Moving-knife procedure

In the mathematics of social science, and especially game theory, a moving-knife procedure is a type of solution to the fair division problem. The canonical example is the division of a cake using a knife.[1]

The simplest example is a moving-knife equivalent of the I cut, you choose scheme, first described by A.K.Austin as a prelude to his own procedure:[2]

(This procedure is not necessarily efficient.)

Generalizing this scheme to more than two players cannot be done by a discrete procedure without sacrificing envy-freeness.

Examples of moving-knife procedures include

References

  1. Elisha Peterson, Francis Edward Su. "Four-Person Envy-Free Chore Division". JSTOR: Mathematics Magazine: Vol. 75, No. 2 (Apr., 2002), pp. 117-122. Retrieved 2008-03-19.
  2. Austin, A. K. (1982). "Sharing a Cake". The Mathematical Gazette 66 (437): 212. doi:10.2307/3616548. JSTOR 3616548.
This article is issued from Wikipedia - version of the Monday, September 07, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.