OpenAlex ·
Cutting a Cake For Human Consumption: An Elementary $n$-agent Cake Cutting Protocol
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.30370
- Original
- Read it at the publisher
- Topics
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.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
Motivation and Contribution in Open Source Software: A Meta-Analytic Investigation
The Delegation Divide: An Open Index of AI-Agent Delegability across Occupations and Countries
The Customer Is the Builder: How AI Coding Agents Are Rewriting the Economics of Software
Joules-to-GDP: How Much Economic Value Do AI Systems Produce per Unit of Energy?
GSP Autobidding Equilibria with Few Advertisers or Slots
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.