词条 | 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. [1] This procedure was the first envy-free moving knife procedure devised for three players. It requires four knives but only two cuts, so each player receives a single connected piece. There is no natural generalization to more than three players which divides the cake without extra cuts. The resulting partition is not necessarily efficient.[2]{{rp|120-121}} ProcedureA referee moves a sword from left to right over the cake, hypothetically dividing it into small left piece and a large right piece. Each player moves a knife over the right piece, always keeping it parallel to the sword. The players must move their knives in a continuous manner, without making any "jumps".[3] When any player shouts "cut", the cake is cut by the sword and by whichever of the players' knives happens to be the central one of the three (that is, the second in order from the sword). Then the cake is divided in the following way:
StrategyEach player can act in a way that guarantees that - according to his own measure - no other player receives more than him:
AnalysisWe now prove that any player using the above strategy receives an envy-free share. First, consider the two quieters. Each of them receives a piece that contains his knife, so they do not envy each other. Additionally, because they remained quiet, the piece they receive is larger in their eyes than Left, so they also don't envy the shouter. The shouter receives Left, which is equal to the piece he could receive by remaining silent and larger than the third piece, hence the shouter does not envy any of the quieters. Following this strategy each person gets the largest or one of the largest pieces by their own valuation and therefore the division is envy-free. The same analysis shows that the division is envy-free even in the somewhat degenerate case when there are two shouters, and the leftmost piece is given to any of them. Dividing a 'bad' cakeThe moving-knives procedure can be adapted for chore division - dividing a cake with a negative value.[4]{{rp|exercise 5.11}} See also
References1. ^{{cite journal | doi = 10.2307/2320951 | title=How to Cut a Cake Fairly | journal=The American Mathematical Monthly | date=1980 | volume=87 | issue=8 | pages=640 | first=Walter | last=Stromquist| jstor=2320951 }} 2. ^{{Cite Brams Taylor 1996}} 3. ^The importance of this continuity is explained here: {{cite web|url=http://mathoverflow.net/questions/180511/stromquists-3-knives-procedure|website=Math Overflow|title=Stromquist's 3 knives procedure|accessdate=14 September 2014}} 4. ^{{cite Robertson Webb 1998}} 1 : Fair division protocols |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。