Fair Division: The Computer Scientist's Perspective
Not on the map. Why?
Abstract (arXiv)
I survey recent progress on a classic and challenging problem in social choice: the fair division of indivisible items. I discuss how a computational perspective has provided interesting insights into and understanding of how to divide items fairly and efficiently. This has involved bringing to bear tools such as those used in knowledge representation, computational complexity, approximation methods, game theory, online analysis and communication complexity
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 May 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 0; 2026: 2.
4 papers.
- 2024Fair Allocation in Dynamic Mechanism Designcited by 1
- 2023Mechanisms that play a game, not toss a coincited by 0
- 2026Envy-Free Allocation of Indivisible Goods via Noisy Queriescited by 0
- 2026Maximin Share Guarantees via Limited Cost-Sensitive Sharingcited by 0
- 2026Maximin Share Guarantees via Limited Cost-Sensitive Sharing24 Feb 2026
- 2026Envy-Free Allocation of Indivisible Goods via Noisy Queries6 Feb 2026
- 2024Fair Allocation in Dynamic Mechanism Design31 May 2024
- 2023Mechanisms that play a game, not toss a coin21 Aug 2023