A Little Charity Guarantees Almost Envy-Freeness

DOI10.1137/1.9781611975994.162OpenAlexW3001150461MaRDI QIDQ5146956

Kurt Mehlhorn, Telikepalli Kavitha, Alkmini Sgouritsa, Bhaskar Chaudhury

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975994.162

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (10)

Fair division is hard even for amicable agents ⋮ Maximum Nash welfare and other stories about EFX ⋮ Existence of EFX for two additive valuations ⋮ Almost Envy-Freeness with General Valuations ⋮ Approximately EFX allocations for indivisible chores ⋮ Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination ⋮ An improved approximation algorithm for maximin shares ⋮ A Little Charity Guarantees Almost Envy-Freeness ⋮ Closing Gaps in Asymptotic Fair Division ⋮ Nash Social Welfare Approximation for Strategic Agents

This page was built for publication: A Little Charity Guarantees Almost Envy-Freeness