Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm


We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n − 1 if there are n players) to divide a cake that the players value along one dimension. While these algorithms may not produce an envy-free or efficient allocation—as these terms are used in the fair-division literature—one, divide-and-conquer (D&C), minimizes… (More)
DOI: 10.1137/080729475


3 Figures and Tables

Slides referencing similar topics