How to Cut a Cake Fairly: A Generalization to Groups
From MaRDI portal
Publication:5144503
DOI10.1080/00029890.2021.1835338zbMath1455.91128arXiv2001.03327OpenAlexW3124854655MaRDI QIDQ5144503
Warut Suksompong, Erel Segal-Halevi
Publication date: 18 January 2021
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.03327
Group preferences (91B10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (3)
Cutting a Cake Fairly for Groups Revisited ⋮ Almost envy-freeness for groups: improved bounds via discrepancy theory ⋮ Consensus Halving for Sets of Items
Cites Work
- Unnamed Item
- Unnamed Item
- Rental harmony with roommates
- Envy-free cake divisions cannot be found by finite protocols
- Dividing a cake fairly
- Democratic fair allocation of indivisible goods
- Fair cake-cutting among families
- Rent division among groups
- Rental Harmony: Sperner's Lemma in Fair Division
- How to Cut A Cake Fairly
- How to Cut a Cake Fairly
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
- Multilabeled Versions of Sperner's and Fan's Lemmas and Applications
This page was built for publication: How to Cut a Cake Fairly: A Generalization to Groups