Envy-free

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematical sociology and especially game theory, envy-free is a property of certain fair division algorithms for a divisible heterogeneous good over which different players may have different preferences.[1]

A division is envy-free if each recipient believes that according to his measure no other recipient has received more than he has. This requirement is stronger than proportional division.

There is a discrete procedure for three players and a moving-knife procedure for four players. Both have a bounded number of cuts. There is also a discrete procedure for any number of players, but this procedure has no fixed bound on the number of cuts required.

The concept generalizes naturally to chore division: in this case, a division is envy-free if each player believes their share is smaller than the other players'. The crucial issue is that no player would wish to swap their share with any other player.

Two players[edit]

Two siblings dividing the last piece of cake using divide and choose is a simple and practical example. The first sibling divides the cake into two pieces, and the second sibling chooses which piece to take. Since both siblings wish to maximize their share of the cake, the first sibling will divide the cake evenly in his estimation and the second sibling will take the one perceived as more desirable. Even if there is icing unevenly on the cake that the siblings want, the first sibling can divide the cake to compensate for the perceived benefit of the icing in his view making them even, and then the second sibling chooses the piece he prefers.

Note that for two players envy-free division is the same as proportional division.

Three players[edit]

Discrete procedure[edit]

Discrete procedures involve only discrete queries to the players. The Selfridge–Conway discrete procedure is a solution to the envy-free problem for three players.

Moving knife procedure[edit]

The drawback of moving-knife procedures is that they cannot be translated into discrete queries to the players involved in the procedure. The Stromquist moving-knife procedure is a solution to the envy-free problem for three players.

Four players[edit]

The Brams, Taylor and Zwicker moving knife algorithm devised in 1997 can ensure an envy free division amongst four people.[2]

Five players and more[edit]

In 1995 Brams and Taylor devised an envy free procedure for any number of people. This is discrete but the number of cuts is unbounded, it is not determined in advance.[3]

For five or more players, the only known exact algorithms have no fixed bound on the number of cuts required.[4]

However, there are approximate algorithms that use the minimal number of cuts, i.e. n-1 cuts for n players.[5]

See also[edit]

References[edit]

  1. ^ Brams, Steven J.; Alan D. Taylor (January 1995). "An Envy-Free Cake Division Protocol". The American Mathematical Monthly (Mathematical Association of America) 102 (1): 9–18. doi:10.2307/2974850. JSTOR 2974850. 
  2. ^ Robertson, Jack; William Webb. Cake-Cutting Algorithms: be fair if you can. A.K.Peters Limited. pp. 65–68. ISBN 1-56881-076-8. 
  3. ^ Robertson, Jack; William Webb. "10". Cake-Cutting Algorithms: be fair if you can. A.K.Peters Limited. pp. 133–136. ISBN 1-56881-076-8. 
  4. ^ S. J. Brams, M. A. Jones, and C. Klamler, "Better ways to cut a cake," Notices of the AMS, 2005. [Online]. Available: http://www.ams.org/notices/200611/fea-brams.pdf
  5. ^ Francis Edward Su, "Rental harmony: Sperner's lemma in fair division," The American Mathematical Monthly, vol. 106, no. 10, pp. 930+, Dec. 1999. [Online]. Available: http://www.math.hmc.edu/~su/papers.dir/rent.pdf