ABSTRACT
No abstract available.
Supplemental Material
- Richard Cole and Vasilis Gkatzelis. Approximating the Nash social welfare with indivisible items. In phProceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, pages 371--380, 2015. Google ScholarDigital Library
- VI Shmyrev. An algorithm for finding equilibrium in the linear exchange model with fixed budgets. phJournal of Applied and Industrial Mathematics, 3 (4): 505--518, 2009.Google ScholarCross Ref
Index Terms
- Convex Program Duality, Fisher Markets, and Nash Social Welfare
Recommendations
Approximating Nash social welfare under rado valuations
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of ComputingWe consider the problem of approximating maximum Nash social welfare (NSW) while allocating a set of indivisible items to n agents. The NSW is a popular objective that provides a balanced tradeoff between the often conflicting requirements of fairness ...
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 ...
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