Improving Nash Social Welfare Approximations

DOI10.1613/jair.1.11618zbMath1451.91076OpenAlexW3024251864MaRDI QIDQ5114782

Jugal Garg, Peter McGlaughlin

Publication date: 26 June 2020

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://www.ijcai.org/Proceedings/2019/0042.pdf

zbMATH Keywords

Pareto optimalityNash social welfarefair allocation of indivisible goods

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (8)

Maximum Nash welfare and other stories about EFX ⋮ Fair Division of Indivisible Goods for a Class of Concave Valuations ⋮ Ordinal Maximin Share Approximation for Goods ⋮ When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores ⋮ Computing fair and efficient allocations with few utility values ⋮ Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination ⋮ Computing fair and efficient allocations with few utility values ⋮ Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings

This page was built for publication: Improving Nash Social Welfare Approximations