Munich Personal RePEc Archive

3 Persons, 2 Cuts: A Maximin Envy-Free and a Maximally Equitable Cake-Cutting Algorithm

Brams, Steven and Landweber, Peter (2018): 3 Persons, 2 Cuts: A Maximin Envy-Free and a Maximally Equitable Cake-Cutting Algorithm.

[img]
Preview
PDF
MPRA_paper_84683.pdf

Download (1MB) | Preview

Abstract

We describe a 3-person, 2-cut envy-free cake-cutting algorithm, inspired by a continuous moving-knife procedure, that does not require that the players continuously move knifes across the cake. By having the players submit their value functions over the cake to a referee—rather than move knives according to these functions—the referee can ensure that the division is not only envy-free but also maximin. In addition, the referee can use the value functions to find a maximally equitable division, whereby the players receive equally valued shares that are maximal, but this allocation may not be envy-free.

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