TY - GEN
T1 - The efficiency of fair division with connected pieces
AU - Aumann, Yonatan
AU - Dombb, Yair
PY - 2010
Y1 - 2010
N2 - We consider 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 - proportionality, envy-freeness and equitability.
AB - We consider 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 - proportionality, envy-freeness and equitability.
UR - http://www.scopus.com/inward/record.url?scp=78650923246&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-17572-5_3
DO - 10.1007/978-3-642-17572-5_3
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:78650923246
SN - 3642175716
SN - 9783642175718
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 26
EP - 37
BT - Internet and Network Economics - 6th International Workshop, WINE 2010, Proceedings
T2 - 6th International Workshop on Internet and Network Economics, WINE 2010
Y2 - 13 December 2010 through 17 December 2010
ER -