Approximately EFX allocations for indivisible chores
From MaRDI portal
Publication:6152663
DOI10.1016/j.artint.2023.104037arXiv2109.07313MaRDI QIDQ6152663
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
68W25: Approximation algorithms
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
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