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

DOI10.1007/978-3-031-06678-8_25MaRDI QIDQ2169968zbMATH OpenOpenAlexFDO

Authors Asei Inoue, Yusuke Kobayashi

Publication date 30 August 2022

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

zbMATH Keywords

additive approximation algorithmNash social welfaretarget load balancing problem

Mathematics Subject Classification ID

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

Cites work

• Approximating Nash social welfare under rado valuations
• Approximating the Nash social welfare with budget-additive valuations
• Approximation schemes for scheduling on parallel machines
• APX-hardness of maximizing Nash social welfare with indivisible items
• Consensus of Subjective Probabilities: The Pari-Mutuel Method
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• scientific article; zbMATH DE number 2021757 (Why is no real title available?)
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
• Nash social welfare for indivisible items under separable, piecewise-linear concave utilities
• On fair division for indivisible items
• The bargaining problem
• The Nash Social Welfare Function

Cited in

(2)

• Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
• An additive approximation scheme for the Nash social welfare maximization with identical additive valuations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169968)