论文信息 - A Pie That Can't Be Cut Fairly (revised for DSP)

A Pie That Can't Be Cut Fairly (revised for DSP)

David Gale asked (Math. Intel. 1993) whether, when a pie is to be divided among n claimants, it is always possible to find a division that is both envy free and undominated. The pie is cut along n radii and the claimants' preferences are described by separate measures. We answer Gale's question in the negative for n=3 by exhibiting three measures on a pie such that, when players have these measures, no division of the pie can be both envy free and undominated. The measures assign positive values to pieces with positive area.

Walter Stromquist | W. Stromquist

[1] Jack M. Robertson,et al. Cake-cutting algorithms - be fair if you can , 1998 .

[2] Douglas R. Woodall,et al. Sets on Which Several Measures Agree , 1985 .

[3] Steven J. Brams. Fair Division* , 2009, Encyclopedia of Complexity and Systems Science.

[4] W. Stromquist. How to Cut a Cake Fairly , 1980 .

[5] Lester E. Dubins,et al. How to Cut a Cake Fairly , 1961 .

[6] David Gale,et al. Tracking the Automatic ANT , 1998 .

[7] Hervé Moulin,et al. Fair division and collective welfare , 2003 .

[8] Walter Stromquist,et al. Cutting a Pie Is Not a Piece of Cake , 2008, Am. Math. Mon..

[9] SU Francisedward. RENTAL HARMONY : SPERNER ’ S LEMMA IN FAIR DIVISION , 2000 .

[10] Steven J. Brams,et al. Proportional pie-cutting , 2008, Int. J. Game Theory.

[11] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .