Abstract
We prove that in a certain cake cutting model, every fair cake division protocol for n players must use Ω(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. © Springer-Verlag 2003.
Cite
CITATION STYLE
APA
Sgall, J., & Woeginger, G. J. (2003). A Lower Bound for Cake Cutting. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2832, 459–469. https://doi.org/10.1007/978-3-540-39658-1_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free