Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.30370

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

Alexandros Psomas
View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

cs.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexandros Psomas. 2026-10-21. Cutting a Cake For Human Consumption: An Elementary $n$-agent Cake Cutting Protocol. https://arxiv.org/abs/2610.30370

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Selling to Non-linear Agents: A Demand-Based Auction

Auctions allocate scarce goods, from car licenses to online advertising, to buyers whose utilities are often not linear in money, as with budgets or risk aversion. We ask how a seller should sell to such buyers and what learning their preferences is worth. We propose demand-based auctions, which elicit demand curves and are dominant-strategy incentive compatible for any non-linear utilities. The revenue-maximizing one takes familiar second-price forms and is max-min optimal when the seller observes only demand curves. Under standard assumptions, learning risk attitudes beyond demand curves adds relatively little revenue, as does learning budgets unless they correlate with values.

cs.GT↗
arXiv2026

Voting with Partial Orders: The Plurality and Anti-Plurality Classes

In the theory of voting, the Plurality rule for preferences that come in the form of linear orders selects the alternatives most frequently appearing in the first position of those orders, while the Anti-Plurality rule selects the alternatives least often occurring in the final position. We explore extensions of these rules to preferences that are partial orders, offering axiomatic characterisations for them.

cs.GT↗
arXiv2026

Fair Division with Indivisible Goods, Chores, and Cake

We study the problem of fairly allocating indivisible items and a desirable heterogeneous divisible good (i.e., cake) to agents with additive utilities. In our paper, each indivisible item can be a good that yields non-negative utilities to some agents and a chore that yields negative utilities to the other agents. Given a fixed set of divisible and indivisible resources, we investigate almost envy-free allocations, captured by the natural fairness concept of envy-freeness for mixed resources (EFM). It requires that an agent $i$ not envy another agent $j$ if agent $j$'s bundle contains any piece of cake yielding positive utility to agent $i$ (i.e., envy-freeness), and that agent $i$ be envy-free up to one item (EF1) towards agent $j$ otherwise. We prove that with indivisible items and a cake, an EFM allocation always exists for any number of agents with additive utilities. We reduce the problem of showing the existence of EFM to the problem of proving the compatibility of EF1 and envy-freeability. An allocation of indivisible items is said to be envy-freeable if the allocation can be made envy-free by allocating a sufficient amount of money to each of the agents. We show that for indivisible items, an EF1 and envy-freeable allocation always exists. Moreover, such an allocation can be found in polynomial time. This result, in and of itself, is of independent interest.

cs.GT↗