Throw one's cake - And eat it too

Orit Arzi, Yonatan Aumann, Yair Dombb

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

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.

Original languageEnglish
Title of host publicationAlgorithmic Game Theory - 4th International Symposium, SAGT 2011, Proceedings
Pages69-80
Number of pages12
DOIs
StatePublished - 2011
Event4th International Symposium on Algorithmic Game Theory, SAGT 2011 - Amalfi, Italy
Duration: 17 Oct 201119 Oct 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6982 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Symposium on Algorithmic Game Theory, SAGT 2011
Country/TerritoryItaly
CityAmalfi
Period17/10/1119/10/11

Bibliographical note

Place of conference:Salerno - Amalfi Coast, Italy

Fingerprint

Dive into the research topics of 'Throw one's cake - And eat it too'. Together they form a unique fingerprint.

Cite this