The efficiency of fair division with connected pieces
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Hi-index | 0.07 |
Let the cake be represented by the unit interval and let each player have a valuation expressed by a nonatomic probability measure. A cake division is said to be equitable if the value of the piece assigned to a player by his measure is the same for all players. We show that for any number n of players in any order an equitable division exists, giving each player a contiguous cake piece. Moreover, there is at least one order in which the common value is not smaller than 1/n.