Cake-Cutting with Different Entitlements: How Many Cuts are Needed?
Not on the map. Why?
Abstract (arXiv)
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 2 n -2 cuts may be necessary, and O(n log(n)) cuts are always sufficient.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 14 Mar 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.