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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brams, S.J., Taylor, A.D.: Fair Division – From cake cutting to dispute resolution. Cambridge University Press, Cambridge (1996)
Even, S., Paz, A.: A note on cake cutting. Discrete Applied Mathematics 7, 285–296 (1984)
Krumke, S.O., Lipmann, M., de Paepe, W., Poensgen, D., Rambau, J., Stougie, L., Woeginger, G.J.: How to cut a cake almost fairly. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 263–264 (2002)
Magdon-Ismail, M., Busch, C., Krishnamoorthy, M.S.: Cake cutting is not a piece of cake. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 596–607. Springer, Heidelberg (2003)
Robertson, J.M., Webb, W.A.: Minimal number of cuts for fair division. Ars Combinatoria 31, 191–197 (1991)
Robertson, J.M., Webb, W.A.: Approximating fair division with a limited number of cuts. Journal of Combinatorial Theory, Series A 72, 340–344 (1995)
Robertson, J.M., Webb, W.A.: Cake-cutting algorithms: Be fair if you can. A.K. Peters Ltd. (1998)
Steinhaus, H.: The problem of fair division. Econometrica 16, 101–104 (1948)
Webb, W.A.: How to cut a cake fairly using a minimal number of cuts. Discrete Applied Mathematics 74, 183–190 (1997)
Woeginger, G.J.: An approximation scheme for cake division with a linear number of cuts. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 896–901. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sgall, J., Woeginger, G.J. (2003). A Lower Bound for Cake Cutting. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive