Cake-Cutting with Different Entitlements: How Many Cuts are Needed?
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 2 n -2 cuts may be necessary, and O(n (n)) cuts are always sufficient.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.