Reproduce “Cutting a Cake For Human Consumption: An Elementary $n$-agent Cake Cutting Protocol” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Alexandros Psomas

The protocol gives complete envy-free allocations of a divisible resource among any number of agents using only value and cut queries. It builds a fair partial allocation, identifies agents who can safely receive the residue, and recurses. Under additive, non-atomic valuations in the Robertson–Webb model, it uses 2^O(n log n) queries. The paper emphasizes clearer organization and proof, not demonstrated practical speed.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.