TY - GEN
T1 - Throw one's cake - And eat it too
AU - Arzi, Orit
AU - Aumann, Yonatan
AU - Dombb, Yair
N1 - Place of conference:Salerno - Amalfi Coast, Italy
PY - 2011
Y1 - 2011
N2 - We consider the problem of fairly dividing a heterogeneous cake between a number of players with different tastes. In this setting, it is known that fairness requirements may result in a suboptimal division from the social welfare standpoint. Here, we show that in some cases, discarding some of the cake and fairly dividing only the remainder may be socially preferable to any fair division of the entire cake. We study this phenomenon, providing asymptotically-tight bounds on the social improvement achievable by such discarding.
AB - We consider the problem of fairly dividing a heterogeneous cake between a number of players with different tastes. In this setting, it is known that fairness requirements may result in a suboptimal division from the social welfare standpoint. Here, we show that in some cases, discarding some of the cake and fairly dividing only the remainder may be socially preferable to any fair division of the entire cake. We study this phenomenon, providing asymptotically-tight bounds on the social improvement achievable by such discarding.
UR - http://www.scopus.com/inward/record.url?scp=80054045156&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-642-24829-0_8
DO - https://doi.org/10.1007/978-3-642-24829-0_8
M3 - منشور من مؤتمر
SN - 9783642248283
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 69
EP - 80
BT - Algorithmic Game Theory - 4th International Symposium, SAGT 2011, Proceedings
T2 - 4th International Symposium on Algorithmic Game Theory, SAGT 2011
Y2 - 17 October 2011 through 19 October 2011
ER -