2026-08-02T15:47:51Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13359 2024-03-06T10:51:47Z ddc:004 open_access

Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts Asano, Takao Umeda, Hiroyuki cake-cutting problem envy-freeness fairness truthfulness mechanism design 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Takao Asano and Hiroyuki Umeda 2020 Is Part Of LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2020.15 urn:nbn:de:0030-drops-133599 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.15 eng https://creativecommons.org/licenses/by/3.0/legalcode