Constant-Factor EFX Exists for Chores
Open Access
- 15 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1580-1589
Abstract
No abstract availableAll Related Versions
Funding Information
- NSF (National Science Foundation) (CCF-1942321)
- National Science Foundation (CCF-2334461)
This publication has 57 references indexed in Scilit:
- Approximately EFX allocations for indivisible choresArtificial Intelligence, 2023
- EFX Allocations for Indivisible Chores: Matching-Based Approach2023
- Fair division of indivisible goods: Recent progress and open questionsArtificial Intelligence, 2023
- A Tight Negative Example for MMS Fair Allocations2022
- Maximum Nash welfare and other stories about EFXTheoretical Computer Science, 2021
- Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle eliminationTheoretical Computer Science, 2020
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocationOperations Research Letters, 2020
- Efficient reallocation under additive and responsive preferencesTheoretical Computer Science, 2019
- APX-hardness of maximizing Nash social welfare with indivisible itemsInformation Processing Letters, 2017
- On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences2009