“Moving-knife procedure”的意思、由来-开放百科全书

词条

Moving-knife procedure

释义

References

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]

One player moves the knife across the cake, conventionally from left to right.
The cake is cut when either player calls "stop".
If each player calls stop when he or she perceives the knife to be at the 50-50 point, then the first player to call stop will produce an envy-free division if the caller gets the left piece and the other player gets the right piece.

(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

The Stromquist moving-knives procedure
The Austin moving-knife procedures
The Levmore–Cook moving-knives procedure
The Robertson–Webb rotating-knife procedure
The Dubins–Spanier moving-knife procedure
The Webb moving-knife procedure

References

1. ^{{cite journal|jstor=3219145 : Mathematics Magazine: Vol. 75, No. 2 (Apr., 2002), pp. 117-122|title=Four-Person Envy-Free Chore Division|author=Elisha Peterson, Francis Edward Su}}
2. ^{{Cite journal | doi = 10.2307/3616548| jstor = 3616548| title = Sharing a Cake| journal = The Mathematical Gazette| volume = 66| issue = 437| pages = 212| year = 1982| last1 = Austin | first1 = A. K.}}

2 : Game theory|Fair division

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。