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 $2n-2$ cuts may be necessary, and $O(n\log (n))$ cuts are always sufficient.

Shorten the proof of the upper bound

Cited by in corpus (13)

• Weighted Envy-Freeness in Indivisible Item Allocation
• Picking Sequences and Monotonicity in Weighted Fair Division
• Fair Cake-Cutting among Families
• Mind the Gap: Cake Cutting With Separation
• Redividing the Cake
• Competitive Equilibrium For Almost All Incomes: Existence and Fairness
• Efficient Fair Division with Minimal Sharing
• Weighted Fairness Notions for Indivisible Items Revisited
• Keep Your Distance: Land Division With Separation
• Asymptotic Analysis of Weighted Fair Division
• Fair Multi-Cake Cutting
• Connectedness in weighted consensus division of graphical cakes between two agents
• The Boltzmann fair division for distributive justice