TY - JOUR
T1 - The efficiency of fair division with connected pieces
AU - Aumann, Yonatan
AU - Dombb, Yair
PY - 2015/7/1
Y1 - 2015/7/1
N2 - The cake-cutting setting, in which a single heterogeneous good must be divided between multiple parties with different tastes, is a classic model for studying questions regarding fairness in resource allocation. In this work, we turn our attention to (economic) efficiency considerations in cake cutting, examining the possible trade-offs between meeting the fairness criteria, on the one hand, and maximizing social welfare, on the other. We focus on divisions that give each agent a single (contiguous) piece of the cake and provide tight bounds (or, in some cases, nearly tight) on the possible degradation in utilitarian and egalitarian welfare resulting from meeting the fairness requirements.
AB - The cake-cutting setting, in which a single heterogeneous good must be divided between multiple parties with different tastes, is a classic model for studying questions regarding fairness in resource allocation. In this work, we turn our attention to (economic) efficiency considerations in cake cutting, examining the possible trade-offs between meeting the fairness criteria, on the one hand, and maximizing social welfare, on the other. We focus on divisions that give each agent a single (contiguous) piece of the cake and provide tight bounds (or, in some cases, nearly tight) on the possible degradation in utilitarian and egalitarian welfare resulting from meeting the fairness requirements.
KW - Cake cutting
KW - Price of fairness
KW - Social efficiency
UR - http://www.scopus.com/inward/record.url?scp=84955368347&partnerID=8YFLogxK
U2 - 10.1145/2781776
DO - 10.1145/2781776
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84955368347
SN - 2167-8375
VL - 3
JO - ACM Transactions on Economics and Computation
JF - ACM Transactions on Economics and Computation
IS - 4
M1 - 23
ER -