Reproduce “Exact Envy-Free Cake Cutting with Polynomial Expected Queries” 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

Simon Mackenzie, Mashbat Suzuki

The authors present a randomized protocol for dividing a cake completely and without envy among agents. It uses value and cut queries, random points, and a completion procedure that turns envy-free partial allocations into a full division. For every fixed preference profile, it terminates with probability one and uses an expected O(n^30) RobertsonWebb query bound; this is not a worst-case bound.

Summary by alphaXiv.

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