@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}
}