Levmore–Cook moving-knives procedure

The Levmore–Cook moving-knives procedure is a procedure for envy-free cake-cutting among three partners. It is named after Saul X. Levmore and Elizabeth Early Cook who presented it in 1981. [1] It assumes that the cake is two-dimensional. It requires two knives and four cuts, so some partners may receive disconnected pieces.

Procedure

We name the partners Alice, Bob and Carl.

Initially, Alice cuts the cake to three pieces equal in her eyes. Bob and Carl each point to their favorite piece.

Easy case: Bob and Carl point to different pieces. Each receives his favorite piece and Alice the remaining piece.

Hard case: Bob and Carl point to the same piece. Say this is piece X and the other pieces are Y and Z. Now Alice takes two knives and moves them simultaneously over piece X:

    • Knife #1 is moved horizontally from the left of piece X to its right. It divides piece X to two pieces: the left piece XL and the right piece XR.
    • Knife #2 is moved vertically, to the left of Knife #1, such that XL is divided to two equal pieces in her eyes: the left-top XLT and the left-bottom XLB.

Initially XR=X, so for Bob and Carl it is bigger than Y and Z. Moreover, Initially XLT and XLB are empty so XR is bigger than the two pairs: Y+XLT and Z+XLB.

As Knife #1 moves rightwards, XR shrinks while XLT and XLB grows. At some point, either Bob or Carl thinks that XR equals one of the two pairs. The first one that thinks there is equality, shouts "stop!" and receives his chosen pair. Alice receives the other pair, and the non-shouter receive XR.

Analysis

We analyze the case when Bob shouted "stop!" and picked the pair Y+XLT. Alice gets Z+XLB and Carl gets XR. The division is envy-free because:

  • For Alice, Z>X>XR so Alice does not envy Carl. Moreover, Z=Y and XLB=XLT so Alice does not envy Bob.
  • For Bob, Y+XLT=XR>Z+XLB, so Bob does not envy.
  • For Carl, XR is larger than both pairs (since he did not shout) so he does not envy.

The other cases are analogous.

Variants

It is possible to let the shouter choose one of the four pairs: Y+XLT, Y+XLB, Z+XLT, Z+XLB. This modification favors the non-shouter, since the shouter will typically shout "stop" sooner.[2]

Levmore and Cook presented a generalization of their procedure for 4 partners. However, it was later shown that this generalization does not work in all cases.[3]:122–124

See also

The Stromquist moving-knives procedure uses four knives, but only two of them should cut, so each partner receives a connected piece.

References
  1. Saul X. Levmore and Elizabeth Early Cook (1981). Super strategies for puzzles and games. Garden City, NYurl=https://catalog.lib.uchicago.edu/vufind/Record/4476190: Doubleday.CS1 maint: uses authors parameter (link) CS1 maint: location (link)
  2. Cytron, Ron (2012). "Cake Cutting Algorithms - Lecture 8" (PDF). Retrieved 27 August 2016.
  3. Brams, Steven J.; Taylor, Alan D. (1996). Fair division: from cake-cutting to dispute resolution. Cambridge University Press. ISBN 0-521-55644-9.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.