DROPS

Document

DOI: 10.4230/LIPIcs.ISAAC.2020.15

Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts

Authors: Takao Asano and Hiroyuki Umeda

Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)

Abstract

The mechanism for the cake-cutting problem based on the expansion process with unlocking proposed by Alijani, Farhadi, Ghodsi, Seddighin, and Tajik [Reza Alijani et al., 2017; Masoud Seddighin et al., 2019] uses a small number of cuts, but is not actually envy-free and truthful, although they claimed that it is envy-free and truthful. In this paper, we consider the same cake-cutting problem and give a new envy-free and truthful mechanism with a small number of cuts, which is not based on their expansion process with unlocking.

Cite as

Takao Asano and Hiroyuki Umeda. Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{asano_et_al:LIPIcs.ISAAC.2020.15,
  author =	{Asano, Takao and Umeda, Hiroyuki},
  title =	{{Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts}},
  booktitle =	{31st International Symposium on Algorithms and Computation (ISAAC 2020)},
  pages =	{15:1--15:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-173-3},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{181},
  editor =	{Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.15},
  URN =		{urn:nbn:de:0030-drops-133599},
  doi =		{10.4230/LIPIcs.ISAAC.2020.15},
  annote =	{Keywords: cake-cutting problem, envy-freeness, fairness, truthfulness, mechanism design}
}

Search Results

Documents authored by Umeda, Hiroyuki

Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts

Abstract

Cite as

Thanks for your feedback!

Could not send message