The Efficiency of Fair Division with Connected Pieces

  • Yonatan Aumann
  • Yair Dombb
Conference paper

DOI: 10.1007/978-3-642-17572-5_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6484)
Cite this paper as:
Aumann Y., Dombb Y. (2010) The Efficiency of Fair Division with Connected Pieces. In: Saberi A. (eds) Internet and Network Economics. WINE 2010. Lecture Notes in Computer Science, vol 6484. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yonatan Aumann
    • 1
  • Yair Dombb
    • 1
  1. 1.Department of Computer ScienceBar-Ilan UniversityRamat GanIsrael

Personalised recommendations