Simultaneous Cake Cutting

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  • Eric Balkanski, Carnegie Mellon University, United States
  • Simina Branzei
  • David Kurokawa, Carnegie Mellon University, United States
  • Ariel D. Procaccia, Carnegie Mellon University, United States
We introduce the simultaneous model for cake cutting (the fair allocation of a divisible good), in which agents simultaneously send messages containing a sketch of their preferences over the cake. We show that this model enables the computation of divisions that satisfy proportionality — a popular fairness notion — using a protocol that circumvents
a standard lower bound via parallel information elicitation. Cake divisions satisfying another prominent fairness notion, envy-freeness, are impossible to compute in the simultaneous model, but admit arbitrarily good approximations.
Original languageEnglish
Title of host publicationProceedings of the 28th AAAI Conference on Artificial Intelligence
Number of pages7
PublisherAAAI Press
Publication year2014
Publication statusPublished - 2014
EventTwenty-Eighth Conference on Artificial Intelligence - Québec City, Canada
Duration: 27 Jul 201431 Jul 2014
Conference number: 28


ConferenceTwenty-Eighth Conference on Artificial Intelligence
ByQuébec City

See relations at Aarhus University Citationformats

Download statistics

No data available

ID: 77425039