Metraipolis › archive › dc_258c2ff66e8a

Cutting a Cake For Human Consumption: An Elementary $n$-agent Cake Cutting Protocol — arXiv:2610.30370

Source: arXiv (en)
Original: https://arxiv.org/abs/2610.30370
License (as archived): CC0-1.0
Archived: 2026-10-25T08:39:38.832Z
SHA-256 of the archived text: bbeaa237663dc5e2eba4b6d96b7ab4bbbbf14bbc6dd4ca729cdf151e01701c0a
Stable URL of this page: https://metraipolis.com/documento/dc_258c2ff66e8a

How to cite

Cutting a Cake For Human Consumption: An Elementary $n$-agent Cake Cutting Protocol — arXiv:2610.30370 — arXiv (en), https://arxiv.org/abs/2610.30370 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_258c2ff66e8a (Metraipolis archive dc_258c2ff66e8a, sha256 bbeaa237663dc5e2eba4b6d96b7ab4bbbbf14bbc6dd4ca729cdf151e01701c0a)

BibTeX

@misc{dc258c2ff66e8a,
  title = {Cutting a Cake For Human Consumption: An Elementary $n$-agent Cake Cutting Protocol — arXiv:2610.30370},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.30370},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_258c2ff66e8a; sha256 bbeaa237663dc5e2eba4b6d96b7ab4bbbbf14bbc6dd4ca729cdf151e01701c0a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.30370. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: economia dei servizi IA (elenco arXiv cs.GT, nuovi lavori del giorno).
Categorie arXiv: Computer Science and Game Theory (cs.GT).
Pagina del lavoro: https://arxiv.org/abs/2610.30370 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-25T08:33:12.783Z dalla pagina https://arxiv.org/list/cs.GT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).