Computer Science – Discrete Mathematics
Scientific paper
2008-12-23
In: Fete of Combinatorics and Computer Science, Bolyai Society Mathematical Studies, vol. 20, pp. 63-93, Springer, 2010
Computer Science
Discrete Mathematics
29 pages, 14 figures
Scientific paper
10.1007/978-3-642-13580-4_4
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.
Cibulka Josef
Kyncl Jan
Mészáros Viola
Stolař Rudolf
Valtr Pavel
No associations
LandOfFree
Solution of Peter Winkler's Pizza Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Solution of Peter Winkler's Pizza Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solution of Peter Winkler's Pizza Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-605274