A Little Charity Guarantees Almost Envy-Freeness
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12188
- Type
- E - Conference contribution
- DOI
-
10.1137/1.9781611975994.162
- Title of conference / published proceedings
- SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms
- First page
- 2658
- Volume
- 2020-January
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- January
- Year of publication
- 2020
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper studies fair division for indivisible goods with bounded charity. Several follow up works already directly use the techniques introduced in this paper. For example, "Envy-free Relaxations for Goods, Chores, and Mixed Items" (Berczi et al, arXiv'20) use our potential function; "Existence of EFX for Two Additive Valuations" (Mahara, arXiv'20) uses Lemma 10 (Mahara's numbering); and "EFX Exists for Three Agents" (Chaudhury, Garg, and Mehlhorn, EC'20) uses our update rules.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
