# Cake-Cutting with Different Entitlements: How Many Cuts are Needed?

arXiv: https://arxiv.org/abs/1803.05470 · HTML: https://mlsanity.com/paper/1803.05470/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Mar 2018.

## Built on by (most cited first, 2 of 2)

- [Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting](https://mlsanity.com/paper/2402.08547/) (2024)
- [Exact Cut Complexity of Equal-Length Proportional Cake Cutting](https://mlsanity.com/paper/2610.19733/) (2026)

## 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.