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 prove the following result: For every ¿>0, there exists a cake division scheme for n players that uses at most c ¿n cuts, and in which each player can enforce to get a share of at least (1-¿)/nof the cake according to his own private measure
|Title of host publication||Algorithms - ESA 2002 (Proceedings of the 10th Annual European Symposium, Rome, Italy, September 17-21, 2002)|
|Place of Publication||Berlin|
|Publication status||Published - 2002|
|Name||Lecture Notes in Computer Science|