Throw One’s Cake — and Eat It Too

  • Orit Arzi
  • Yonatan Aumann
  • Yair Dombb
Conference paper

DOI: 10.1007/978-3-642-24829-0_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6982)
Cite this paper as:
Arzi O., Aumann Y., Dombb Y. (2011) Throw One’s Cake — and Eat It Too. In: Persiano G. (eds) Algorithmic Game Theory. SAGT 2011. Lecture Notes in Computer Science, vol 6982. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

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

Personalised recommendations