Simultaneous Cake Cutting

Eric Balkanski, Simina Brânzei, David Kurokawa, Ariel D. Procaccia

AAAI 2014 pp. 566-572

doi:10.1609/AAAI.V28I1.8802 /aaai/2014/balkanski2014aaai-simultaneous/

Abstract

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.

PDF AAAI Semantic Scholar

Cite

Text

Balkanski et al. "Simultaneous Cake Cutting." AAAI Conference on Artificial Intelligence, 2014. doi:10.1609/AAAI.V28I1.8802

Markdown

[Balkanski et al. "Simultaneous Cake Cutting." AAAI Conference on Artificial Intelligence, 2014.](https://mlanthology.org/aaai/2014/balkanski2014aaai-simultaneous/) doi:10.1609/AAAI.V28I1.8802

BibTeX

@inproceedings{balkanski2014aaai-simultaneous,
  title     = {{Simultaneous Cake Cutting}},
  author    = {Balkanski, Eric and Brânzei, Simina and Kurokawa, David and Procaccia, Ariel D.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2014},
  pages     = {566-572},
  doi       = {10.1609/AAAI.V28I1.8802},
  url       = {https://mlanthology.org/aaai/2014/balkanski2014aaai-simultaneous/}
}