Levmore–Cook Moving-knives Procedure
   HOME

TheInfoList



OR:

The Levmore–Cook moving-knives procedure is a procedure for
envy-free cake-cutting An envy-free cake-cutting is a kind of fair cake-cutting. It is a division of a heterogeneous resource ("cake") that satisfies the envy-free criterion, namely, that every partner feels that their allocated share is at least as good as any other sha ...
among three partners. It is named after Saul X. Levmore and Elizabeth Early Cook who presented it in 1981. It assumes that the cake is
two-dimensional In mathematics, a plane is a Euclidean ( flat), two-dimensional surface that extends indefinitely. A plane is the two-dimensional analogue of a point (zero dimensions), a line (one dimension) and three-dimensional space. Planes can arise as ...
. It requires a referee, two
knives A knife ( : knives; from Old Norse 'knife, dirk') is a tool or weapon with a cutting edge or blade, usually attached to a handle or hilt. One of the earliest tools used by humanity, knives appeared at least 2.5 million years ago, as evidenced ...
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 the referee (ideally it could be Alice) takes one knife and moves it horizontally over piece X, and Alice takes the other knife and moves it vertically over piece X: * Knife #1 is moved ''horizontally'' and ''continuously'' by the referee 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 and simultaneously'' by Alice, 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 Equality may refer to: Society * Political equality, in which all members of a society are of equal standing ** Consociationalism, in which an ethnically, religiously, or linguistically divided state functions by cooperation of each group's elit ...
, shouts "stop!" and receives his chosen pair, either Y+XLT or Z+XLB. Alice receives the other pair, and the non-shouter receives 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 Analogy (from Greek ''analogia'', "proportion", from ''ana-'' "upon, according to" lso "against", "anew"+ ''logos'' "ratio" lso "word, speech, reckoning" is a cognitive process of transferring information or meaning from a particular subject ...
.


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. Levmore and Cook presented a
generalization A generalization is a form of abstraction whereby common properties of specific instances are formulated as general concepts or claims. Generalizations posit the existence of a domain or set of elements, as well as one or more common characte ...
of their procedure for 4 partners. However, it was later shown that this generalization does not work in all cases.


See also

The
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. This procedure was the first envy-free moving knife procedure devised for three pla ...
uses four knives, but only two of them should cut, so each partner receives a connected piece.


References

{{DEFAULTSORT:Levmore-Cook moving-knives procedure Fair division protocols Cake-cutting