Computing fair and efficient allocations with few utility values

DOI10.1016/j.tcs.2023.113932OpenAlexW4376254362MaRDI QIDQ6159026

Jugal Garg, Aniket Murhekar

Publication date: 1 June 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113932

zbMATH Keywords

EFXNash welfareEQXfair and efficient allocation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing Nash product social welfare in allocating indivisible goods
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• APX-hardness of maximizing Nash social welfare with indivisible items
• Assigning papers to referees
• Efficient reallocation under additive and responsive preferences
• Maximum Nash welfare and other stories about EFX
• Computing fair and efficient allocations with few utility values
• Approximating the Nash Social Welfare with Indivisible Items
• On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
• On fair division for indivisible items
• Almost Envy-Freeness with General Valuations
• Improving Nash Social Welfare Approximations
• On (1,∊)-Restricted Assignment Makespan Minimization
• Random Matching Under Dichotomous Preferences
• Sur la division pragmatique

This page was built for publication: Computing fair and efficient allocations with few utility values