Munich Personal RePEc Archive

Two-person cake-cutting: the optimal number of cuts

Barbanel, Julius B. and Brams, Steven J. (2011): Two-person cake-cutting: the optimal number of cuts.

[img]
Preview
PDF
MPRA_paper_34263.pdf

Download (591Kb) | Preview

Abstract

A cake is a metaphor for a heterogeneous, divisible good. When two players divide such a good, there is always a perfect division—one that is efficient (Pareto-optimal), envy-free, and equitable—which can be effected with a finite number of cuts under certain mild conditions; this is not always the case when there are more than two players (Brams, Jones, and Klamler, 2011b). We not only establish the existence of such a division but also provide an algorithm for determining where and how many cuts must be made, relating it to an algorithm, “Adjusted Winner” (Brams and Taylor, 1996, 1999), that yields a perfect division of multiple homogenous goods.

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.