A bounded and envy-free cake cutting algorithm

Autor:	Haris Aziz, Simon Mackenzie
Rok vydání:	2020
Předmět:	General Computer Science Computer science 020204 information systems Bounded function Open problem 0202 electrical engineering electronic engineering information engineering 02 engineering and technology Protocol (object-oriented programming) Algorithm Fair division Envy-free
Zdroj:	Communications of the ACM. 63:119-126
ISSN:	1557-7317 0001-0782
DOI:	10.1145/3382129
Popis:	We consider the well-studied cake cutting problem in which the goal is to find an envy-free allocation of a divisible resource based on queries from agents. The problem has received attention in mathematics, economics, and computer science. It has been a major open problem whether there exists a discrete and bounded envy-free protocol. We report on our algorithm that resolved the open problem.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::9fa1cc19b304e108d134f6ede47963f7 https://doi.org/10.1145/3382129 Zobrazit plný text záznamu Plný text ve formátu PDF