No, Cake Cutting Really is a Piece of Cake
Not on the map. Why?
Abstract (arXiv)
We design and analyze a deterministic cake cutting algorithm that achieves proportional fairness using a linear number of cuts. The best previous upper bound on the number of cuts for a deterministic algorithm was O(n log n), which was obtained by a natural divide-and-conquer algorithm due to Even and Paz. It has long been conjectured that O(n log n) cuts was optimal for a deterministic algorithm.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 5 Jun 2026.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.