How to Cut a Cake almost Fairly HOW TO CUT A CAKE ALMOST FAIRLY

Abstract

In the cake cutting problem, n ≥ 2 players want to cut a cake into n pieces so that every player gets a " fair " share of the cake by his own measure. We describe a protocol with n-1 cuts in which each player can enforce to get a share of at least 1/(2n-2). Moreover we show that no protocol with n-1 cuts can guarantee a better fraction. 

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics