Year: 2026
Type: preprint
Abstract: We give a bounded envy-free cake-cutting protocol for any number $n$ of agents in the Robertson--Webb model, with a short, self-contained, and elementary correctness proof. The protocol uses $2^{O(n \log n)}$ queries. Most ingredients are already known and well understood in the fair division literature; our main contribution is a simpler organization of these ideas into a protocol whose complete description and proof fit in a few pages.
Source: arXiv (Cornell University)
Author: Psomas, Alexandros
Institution: Purdue University West Lafayette
Language: English
Subfield: Economics and Econometrics
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W7223306606
