Abstract
In this letter we briefly discuss our main result from [Cole and Gkatzelis 2015]. Given a set of indivisible items and a set of agents having additive valuations, our goal is to allocate the items to the agents in order to maximize the geometric mean of the agents' valuations, i.e., the Nash social welfare. This problem is known to be NP-hard, and our main result is the first efficient constant-factor approximation algorithm for this objective.
- Cole, R. and Gkatzelis, V. 2015. Approximating the Nash social welfare with indivisible items. In 47th ACM Symposium on Theory of Computing, STOC. Google ScholarDigital Library
- Eisenberg, E. and Gale, D. 1959. Consensus of subjective probabilities: The pari-mutuel method. Ann. Math. Stat. 30, 165--168.Google ScholarCross Ref
- Kaneko, M. and Nakamura, K. 1979. The nash social welfare function. Econometrica 47, 2, pp. 423--435.Google ScholarCross Ref
- Moulin, H. 2003. Fair Division and Collective Welfare. The MIT Press.Google Scholar
- Nash, J. 1950. The bargaining problem. Econometrica 18, 2 (April), 155--162.Google ScholarCross Ref
- Nguyen, T. T. and Rothe, J. 2014. Minimizing envy and maximizing average nash social welfare in the allocation of indivisible goods. Discrete Applied Mathematics 179, 0, 54--68.Google ScholarDigital Library
- Nisan, N., Roughgarden, T., Tardos, É., and Vazirani, V. 2007. Algorithmic Game Theory. Cambridge University Press, New York, NY, USA. Google ScholarDigital Library
Index Terms
Approximating the nash social welfare with indivisible items
Recommendations
Approximating the Nash Social Welfare with Indivisible Items
STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of ComputingWe study the problem of allocating a set of indivisible items among agents with additive valuations, with the goal of maximizing the geometric mean of the agents' valuations, i.e., the Nash social welfare. This problem is known to be NP-hard, and our ...
Greedy Algorithms for Maximizing Nash Social Welfare
AAMAS '18: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent SystemsWe study the problem of fairly allocating a set of indivisible goods among agents with additive valuations. The extent of fairness of an allocation is measured by its Nash social welfare, which is the geometric mean of the valuations of the agents for ...
Nash Social Welfare Approximation for Strategic Agents
EC '17: Proceedings of the 2017 ACM Conference on Economics and ComputationThe fair division of resources among strategic agents is an important age-old problem that has led to a rich body of literature. At the center of this literature lies the question of whether there exist mechanisms that can implement fair outcomes, ...
Comments