@inproceedings{6564d74038404569a55f840eb2d7dc68,
title = "A lower bound for cake cutting",
abstract = "We prove that in a certain cake cutting model, every fair cake division protocol for n players must use O(n log n) cuts in the worst case. Up to a small constant factor, our lower bound matches a corresponding upper bound in the same model by Even & Paz from 1984.",
author = "J. Sgall and G.J. Woeginger",
year = "2003",
doi = "10.1007/978-3-540-39658-1_42",
language = "English",
isbn = "3-540-20064-9",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "459--469",
editor = "{Di Battista}, G. and U. Zwick",
booktitle = "Proceedings of the 11th Annual European Symposium on Algorithms (ESA'2003, Budapest, Hungary, September 16-19, 2003)",
address = "Germany",
}