Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts
Algorithmica, pp. 1-28, 2018.
We study the problem of fair division of a heterogeneous resource among strategic players. Given a divisible heterogeneous cake, we wish to divide the cake among n players to meet these conditions: (I) every player (weakly) prefers his allocated cake to any other player’s share (such notion is known as envy-freeness), (II) the allocation ...More
Full Text (Upload PDF)
PPT (Upload PPT)