Approximately EFX allocations for indivisible chores

DOI10.1016/j.artint.2023.104037arXiv2109.07313OpenAlexW4388440994MaRDI QIDQ6152663

Xiaowei Wu, Sheng-Wei Zhou

Publication date: 13 February 2024

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

Full work available at URL: https://arxiv.org/abs/2109.07313

zbMATH Keywords

approximation algorithmfair allocation

Mathematics Subject Classification ID

Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Splitting necklaces
• Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
• Maximum Nash welfare and other stories about EFX
• A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
• Computing fair and efficient allocations with few utility values
• Rental Harmony: Sperner's Lemma in Fair Division
• Almost Envy-Freeness with General Valuations
• A Little Charity Guarantees Almost Envy-Freeness
• On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
• Fair division of indivisible goods: recent progress and open questions

This page was built for publication: Approximately EFX allocations for indivisible chores