English

Nash Social Welfare for 2-value Instances

Computer Science and Game Theory 2021-10-13 v2

Abstract

This paper is merged with arXiv:2107.08965v2. We refer the reader to the full and updated version. We study the problem of allocating a set of indivisible goods among agents with 2-value additive valuations. Our goal is to find an allocation with maximum Nash social welfare, i.e., the geometric mean of the valuations of the agents. We give a polynomial-time algorithm to find a Nash social welfare maximizing allocation when the valuation functions are integrally 2-valued, i.e., each agent has a value either 11 or pp for each good, for some positive integer pp. We then extend our algorithm to find a better approximation factor for general 2-value instances.

Keywords

Cite

@article{arxiv.2106.14816,
  title  = {Nash Social Welfare for 2-value Instances},
  author = {Hannaneh Akrami and Bhaskar Ray Chaudhury and Kurt Mehlhorn and Golnoosh Shahkarami and Quentin Vermande},
  journal= {arXiv preprint arXiv:2106.14816},
  year   = {2021}
}

Comments

19 pages

R2 v1 2026-06-24T03:40:54.725Z