Internet and Network Economics

Volume 6484 of the series Lecture Notes in Computer Science pp 26-37

The Efficiency of Fair Division with Connected Pieces

  • Yonatan AumannAffiliated withDepartment of Computer Science, Bar-Ilan University
  • , Yair DombbAffiliated withDepartment of Computer Science, Bar-Ilan University

* Final gross prices may vary according to local VAT.

Get Access


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.