@inproceedings{41baa5fc70bf4777baf66c8a0e53a2bf,
title = "An approximation scheme for cake division with a linear number of cuts",
abstract = "In the cake cutting problem, n = 2 players want to cut a cake into n pieces so that every player gets a {\textquoteleft}fair{\textquoteright} 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",
author = "G.J. Woeginger",
year = "2002",
doi = "10.1007/3-540-45749-6_77",
language = "English",
isbn = "978-3-540-44180-9",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "896--901",
booktitle = "Algorithms - ESA 2002 (Proceedings of the 10th Annual European Symposium, Rome, Italy, September 17-21, 2002)",
address = "Germany",
}