License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2020.15
URN: urn:nbn:de:0030-drops-133599
URL: https://drops.dagstuhl.de/opus/volltexte/2020/13359/
Asano, Takao ;
Umeda, Hiroyuki
Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts
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.
BibTeX - Entry
@InProceedings{asano_et_al:LIPIcs:2020:13359,
author = {Takao Asano and Hiroyuki Umeda},
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 = {Yixin Cao and Siu-Wing Cheng and Minming Li},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13359},
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}
}
|
Keywords: |
|
cake-cutting problem, envy-freeness, fairness, truthfulness, mechanism design |
|
Collection: |
|
31st International Symposium on Algorithms and Computation (ISAAC 2020) |
|
Issue Date: |
|
2020 |
|
Date of publication: |
|
04.12.2020 |
