An additive approximation scheme for the Nash social welfare maximization with identical additive valuations

DOI10.1007/978-3-031-06678-8_25OpenAlexW4221139760MaRDI QIDQ2169968

Yusuke Kobayashi, Asei Inoue

Publication date: 30 August 2022

Full work available at URL: https://arxiv.org/abs/2201.01419

zbMATH Keywords

Nash social welfareadditive approximation algorithmtarget load balancing problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
• Approximation schemes for scheduling on parallel machines
• APX-hardness of maximizing Nash social welfare with indivisible items
• The Bargaining Problem
• Consensus of Subjective Probabilities: The Pari-Mutuel Method
• The Nash Social Welfare Function
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities
• On fair division for indivisible items
• Approximating Nash social welfare under rado valuations

This page was built for publication: An additive approximation scheme for the Nash social welfare maximization with identical additive valuations