Abstract
We study the problem of approximating maximum Nash social welfare (NSW) when allocating m indivisible items among n asymmetric agents with submodular valuations. The
In this article, we extend our understanding of the
Furthermore, we show that the
- [1] . 2017. Nash social welfare, matrix permanent, and stable polynomials. In 8th Innovations in Theoretical Computer Science Conf. (ITCS’17). 1–12.Google Scholar
- [2] . 2018. Nash social welfare for indivisible items under separable, piecewise-linear concave utilities. In Proc. 29th Symp. on Discrete Algorithms (SODA’18).Google Scholar
- [3] . 2015. Combinatorial algorithm for restricted max-min fair allocation. In Proc. 26th Symp. on Discrete Algorithms (SODA’15). 1357–1372.Google Scholar
- [4] . 2010. An approximation algorithm for max-min fair allocation of indivisible goods. SIAM Journal on Computing 39, 7 (2010), 2970–2989.Google ScholarDigital Library
- [5] . 2006. The Santa Claus problem. In Symp. on Theory of Computing (STOC’06). 31–40.Google Scholar
- [6] . 2020. Tight approximation algorithms for p-Mean welfare under subadditive valuations. In 28th Annual European Symp. on Algorithms (ESA’20) (Virtual Conference)(
LIPIcs , Vol. 173), , , and (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 11:1–11:17.DOI: Google ScholarCross Ref - [7] . 2021. Sublinear approximation algorithm for Nash social welfare with XOS valuations. arXiv preprint arXiv:2110.00767 (2021).Google Scholar
- [8] . 2018. Finding fair and efficient allocations. In Proc. 19th Conf. on Economics and Computation (EC’18).Google Scholar
- [9] . 2005. Allocating indivisible goods. ACM SIGecom Exchanges 5, 3 (2005), 11–18.Google ScholarDigital Library
- [10] . 2011. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy 119, 6 (2011), 1061–1103.Google ScholarCross Ref
- [11] . 2016. The unreasonable fairness of maximum Nash welfare. In Proc. 17th Conf. on Economics and Computation (EC’16). 305–322.Google Scholar
- [12] . 2010. Bargaining among groups: An axiomatic viewpoint. International Journal of Game Theory 39 (2010), 71–88.Google ScholarDigital Library
- [13] . 2021. Fair and efficient allocations under subadditive valuations. In Proc. AAAI Conf. on Artificial Intelligence, Vol. 35. 5269–5276.Google Scholar
- [14] . 2010. Dependent randomized rounding via exchange properties of combinatorial structures. In 2010 IEEE 51st Annual Symp. on Foundations of Computer Science. IEEE, 575–584.Google Scholar
- [15] . 2018. On fair division of indivisible items. In Proc. 38th Conf. Foundations of Software Technology and Theoretical Computer Science (FSTTCS’18). 25:1–25:17.Google Scholar
- [16] . 2017. Convex program duality, Fisher markets, and Nash social welfare. In Proc. 18th Conf. on Economics and Computation (EC’17).Google Scholar
- [17] . 2018. Approximating the Nash social welfare with indivisible items. SIAM Journal on Computing 47, 3 (2018), 1211–1236.Google Scholar
- [18] . 2019. Group fairness for the allocation of indivisible goods. In Pro. 33rd AAAI Conf. on Artificial Intelligence (AAAI’19).Google Scholar
- [19] . 2020. A tale of Santa Claus, hypergraphs and matroids. In Proc. 14th Annual ACM-SIAM Symp. on Discrete Algorithms. SIAM, 2748–2757.Google Scholar
- [20] . 2018. Bankruptcy to surplus: Sharing transboundary river Basin’s water under scarcity. Water Resources Management 32, 8 (2018), 2735–2751.Google ScholarCross Ref
- [21] . 2019. Approximating the Nash social welfare with budget-additive valuations.
arxiv:1707.04428 (2019). Preliminary version appeared in the Proceedings of SODA 2018 .Google Scholar - [22] . 2022. Approximating Nash social welfare by matching and local search. arXiv:2211.03883 (2022).Google Scholar
- [23] . 2021. Approximating Nash social welfare under Rado valuations. In Proc. of the 53rd Annual ACM SIGACT Symp. on Theory of Computing. 1412–1425.Google Scholar
- [24] . 2020. Approximating Nash social welfare under submodular valuations through (Un)Matchings. In Proc. 31st Symp. on Discrete Algorithms (SODA’20). 2673–2687.Google Scholar
- [25] . 2019. Improving Nash social welfare approximations. In Proc. International Joint Conf. on Artificial Intelligence (IJCAI’19).Google Scholar
- [26] . 2014. Asymmetric Nash solutions in the river sharing problem. Strategic Behavior and the Environment 4, 4 (2014), 321–360.Google ScholarCross Ref
- [27] . 1972. A generalized Nash solution for two-person bargaining games with incomplete information. Management Science 18 (1972), 80–106.Google ScholarDigital Library
- [28] . 1977. Nonsymmetric Nash solutions and replications of 2-person bargaining. International Journal of Game Theory 6 (1977), 129–133.Google ScholarDigital Library
- [29] . 1997. Charging and rate control for elastic traffic. European Transactions on Telecommunications 8 (1997), 33–37.Google ScholarCross Ref
- [30] . 2008. Inapproximability results for combinatorial auctions with submodular utility functions. Algorithmica 52, 1 (2008), 3–18.Google ScholarCross Ref
- [31] . 2007. Approximation algorithms for the max-min allocation problem. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer, 204–217.Google ScholarDigital Library
- [32] . 2007. Bargaining in committees as an extension of Nash’s bargaining theory. Journal of Economic Theory 132 (2007), 291–305.Google ScholarCross Ref
- [33] . 2017. APX-hardness of maximizing Nash social welfare with indivisible items. Information Processing Letters 122 (2017), 17–20.Google ScholarCross Ref
- [34] . 2006. Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior 55, 2 (2006), 270–296.Google ScholarCross Ref
- [35] . 2022. A constant-factor approximation algorithm for Nash social welfare with submodular valuations. In 2021 IEEE 62nd Annual Symp. on Foundations of Computer Science (FOCS’22). IEEE, 25–36.Google Scholar
- [36] . 2003. Fair Division and Collective Welfare. MIT Press.Google ScholarCross Ref
- [37] . 1950. The bargaining problem. Econometrica 18, 2 (1950), 155–162.Google ScholarCross Ref
- [38] . 2014. Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods. Discrete Applied Mathematics 179 (2014), 54–68.Google ScholarDigital Library
- [39] , , , and (Eds.). 2007. Algorithmic Game Theory. Cambridge University Press.Google ScholarCross Ref
- [40] . 2011. Submodular approximation: Sampling-based algorithms and lower bounds. SIAM Journal on Computing 40, 6 (2011), 1715–1737.Google ScholarDigital Library
- [41] . 1986. Replication invariance of bargaining solutions. International Journal on Game Theory 15 (1986), 59–63.Google ScholarDigital Library
- [42] . 1974. Equity, envy, and efficiency. Journal of Economic Theory 9, 1 (1974), 63–91.Google ScholarCross Ref
- [43] . 2008. Optimal approximation for the submodular welfare problem in the value oracle model. In Proc. 40th Symp. on Theory of Computing (STOC’08). 67–74.Google Scholar
- [44] . 2017. Nash bargaining solutions for international climate agreements under different sets of bargaining weights. International Environmental Agreements: Politics, Law and Economics 17, 5 (2017), 709–729.Google ScholarCross Ref
Index Terms
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
Recommendations
Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations
Web and Internet EconomicsAbstractWe study the problem of allocating indivisible goods among agents in a fair and economically efficient manner. In this context, the Nash social welfare—defined as the geometric mean of agents’ valuations for their assigned bundles—stands as a ...
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 ...
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