Sciweavers

Share
WINE
2010
Springer

The Efficiency of Fair Division with Connected Pieces

8 years 11 months ago
The Efficiency of Fair Division with Connected Pieces
der the issue of fair division of goods, using the cake cutting abstraction, and aim to bound the possible degradation in social welfare due to the fairness requirements. Previous work has considered this problem for the setting where the division may allocate each player any number of unconnected pieces. Here, we consider the setting where each player must receive a single connected piece. For this setting, we provide tight bounds on the maximum possible degradation to both utilitarian and egalitarian welfare due to three fairness criteria
Yonatan Aumann, Yair Dombb
Added 15 Feb 2011
Updated 15 Feb 2011
Type Journal
Year 2010
Where WINE
Authors Yonatan Aumann, Yair Dombb
Comments (0)
books