Abstract
A cake has to be divided fairly among n agents. When all agents have equal entitlements, it is known that such a division can be implemented with n−1 cuts. When agents may have different entitlements, the paper shows that at least 2n−2 cuts may be necessary, and O(nlogn) cuts are always sufficient.
Original language | English |
---|---|
Article number | 123382 |
Journal | Journal of Mathematical Analysis and Applications |
Volume | 480 |
Issue number | 1 |
DOIs | |
State | Published - 1 Dec 2019 |
Keywords
- Asymmetric agents
- Connected components
- Fair cake-cutting
- Land division
- Unequal shares
All Science Journal Classification (ASJC) codes
- Analysis
- Applied Mathematics