@inproceedings{7e3ab2b89f724bcc895cffec0f0dc6bd,
title = "Waste makes haste: Bounded time protocols for envy-free cake cutting with free disposal",
abstract = "We consider the classic problem of envy-free division of a heterogeneous good (aka the cake) among multiple agents. It is well known that if each agent must receive a contiguous piece then there is no finite protocol for the problem, whenever there are 3 or more agents. This impossibility result, however, assumes that the entire cake must be allocated. In this paper we study the problem in a setting where the protocol may leave some of the cake un-allocated, as long as each agent obtains at least some positive value (according to its valuation). We prove that this version of the problem is solvable in a bounded time. For the case of 3 agents we provide a finite and bounded-time protocol that guarantees each agent a share with value at least 1/3, which is the most that can be guaranteed.",
keywords = "Cake-cutting, Envy-free, Fair division, Finite algorithm",
author = "Erel Segal-Halevi and Avinatan Hassidim and Yonatan Aumann",
note = "Publisher Copyright: Copyright {\textcopyright} 2015, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.; 14th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015 ; Conference date: 04-05-2015 Through 08-05-2015",
year = "2015",
language = "الإنجليزيّة",
series = "Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS",
pages = "901--908",
editor = "Edith Elkind and Gerhard Weiss and Pinar Yolum and Bordini, {Rafael H.}",
booktitle = "AAMAS 2015 - Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems",
}