Stromquist moving-knives procedure

The Stromquist moving-knives procedure is a procedure for envy-free cake-cutting among three players. It is named after Walter Stromquist who presented it in 1980. [1]

This procedure was the first envy-free moving knife procedure devised for three players. It requires four knives but only two cuts, so each player receives a single connected piece. There is no natural generalization to more than three players which divides the cake without extra cuts. The resulting partition is not necessarily efficient.[2]:120-121

Procedure

Stromquist moving-knife procedure when cake is cut

A referee moves a sword from left to right over the cake, hypothetically dividing it into small left piece and a large right piece. Each player moves a knife over the right piece, always keeping it parallel to the sword. The players must move their knives in a continuous manner, without making any "jumps".[3] When any player shouts "cut", the cake is cut by the sword and by whichever of the players' knives happens to be the central one of the three (that is, the second in order from the sword). Then the cake is divided in the following way:

Strategy

Each player can act in a way that guarantees that - according to his own measure - no other player receives more than him:

Analysis

We now prove that any player using the above strategy receives an envy-free share.

First, consider the two quieters. Each of them receives a piece that contains his knife, so they do not envy each other. Additionally, because they remained quiet, the piece they receive is larger in their eyes then Left, so they also don't envy the shouter.

The shouter receives Left, which is equal to the piece he could receive by remaining silent and larger than the third piece, hence the shouter does not envy any of the quieters.

Following this strategy each person gets the largest or one of the largest pieces by their own valuation and therefore the division is envy-free.

Dividing a 'bad' cake

The moving-knives procedure can be adapted for chore division - dividing a cake with a negative value.[4]:exercise 5.11

See also

References

  1. Stromquist, Walter (1980). "How to Cut a Cake Fairly". The American Mathematical Monthly. 87 (8): 640. doi:10.2307/2320951.
  2. Steven J. Brams; Alan D. Taylor (1996). Fair division: from cake-cutting to dispute resolution. Cambridge University Press. ISBN 978-0-521-55644-6.
  3. The importance of this continuity is explained here: "Stromquist's 3 knives procedure". Math Overflow. Retrieved 14 September 2014.
  4. Robertson, Jack; Webb, William (1998). Cake-Cutting Algorithms: Be Fair If You Can. Natick, Massachusetts: A. K. Peters. ISBN 1-568-81076-8.
This article is issued from Wikipedia - version of the 11/10/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.