# No, Cake Cutting Really is a Piece of Cake

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 5 Jun 2026.

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

- [Exact Cut Complexity of Equal-Length Proportional Cake Cutting](https://mlsanity.com/paper/2610.19733/) (2026)

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