Improving Nash social welfare approximations of indivisible goods

DOI10.1613/JAIR.1.11618zbMATH Open1451.91076OpenAlexW3024251864MaRDI QIDQ5114782FDOQ5114782

Authors: 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

Recommendations

• Approximating the Nash Social Welfare with Indivisible Items
• Approximating the Nash social welfare with indivisible items
• Fair allocation of indivisible goods: improvement
• Nash social welfare for indivisible items under separable, piecewise-linear concave utilities
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods

zbMATH Keywords

Pareto optimalityNash social welfarefair allocation of indivisible goods

Mathematics Subject Classification ID

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

Cited In (25)

• Approximating the Nash Social Welfare with Indivisible Items
• Ordinal Maximin Share Approximation for Goods
• Fair allocation of indivisible goods with minimum inequality or minimum envy
• The price of fairness for indivisible goods
• Nash welfare guarantees for fair and efficient coverage
• Computing fair and efficient allocations with few utility values
• Fair division with allocator's preference
• Approximating the Nash social welfare with budget-additive valuations
• Maximizing Nash product social welfare in allocating indivisible goods
• Nash social welfare approximation for strategic agents
• Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
• Fair Division of Indivisible Goods for a Class of Concave Valuations
• Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
• When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores
• APX-hardness of maximizing Nash social welfare with indivisible items
• Nash social welfare, matrix permanent, and stable polynomials
• On maximum weighted Nash welfare for binary valuations
• LP solvable models for multiagent fair allocation problems
• Approximating the Nash social welfare with indivisible items
• Nash social welfare for indivisible items under separable, piecewise-linear concave utilities
• Maximum Nash welfare and other stories about EFX
• Computing fair and efficient allocations with few utility values
• The price to pay for forgoing normalization in fair division of indivisible goods
• A characterization of maximum Nash welfare for indivisible goods

This page was built for publication: Improving Nash social welfare approximations of indivisible goods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114782)