Abstract
Bob cuts a pizza into slices of not necessarily equal size and shares it with Alice by alternately taking turns. One slice is taken in each turn. The first turn is Alice’s. She may choose any of the slices. In all other turns only those slices can be chosen that have a neighbor slice already eaten. We prove a conjecture of Peter Winkler by showing that Alice has a strategy for obtaining 4/9 of the pizza. This is best possible, that is, there is a cutting and a strategy for Bob to get 5/9 of the pizza. We also give a characterization of Alice’s best possible gain depending on the number of slices. For a given cutting of the pizza, we describe a linear time algorithm that computes Alice’s strategy gaining at least 4/9 of the pizza and another algorithm that computes the optimal strategy for both players in any possible position of the game in quadratic time. We distinguish two types of turns, shifts and jumps. We prove that Alice can gain 4/9, 7/16 and 1/3 of the pizza if she is allowed to make at most two jumps, at most one jump and no jump, respectively, and the three constants are the best possible.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Cibulka, J. Kynčl, V. Mészáros, R. Stolař and P. Valtr, Generalizations of Peter Winkler’s Pizza Problem, in preparation.
H. Gourvest, LPSolve IDE v5.5, http://www.progdigy.com M. Berkelaar, J. Dirks, K. Eikland and P. Notebaert, lp_solve 5.5, http://lpsolve.sourceforge.net/5.5
K. Knauer, P. Micek and T. Ueckerdt, How to eat 4/9 of a pizza, manuscript.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 János Bolyai Mathematical Society and Springer-Verlag
About this chapter
Cite this chapter
Cibulka, J., Stolař, R., Kynčl, J., Mészáros, V., Valtr, P., Mészáros, V. (2010). Solution of Peter Winkler’s Pizza Problem*†. In: Katona, G.O.H., Schrijver, A., Szőnyi, T., Sági, G. (eds) Fete of Combinatorics and Computer Science. Bolyai Society Mathematical Studies, vol 20. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13580-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-13580-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13579-8
Online ISBN: 978-3-642-13580-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)