A bounded and envy-free cake cutting algorithm

Authors: Haris Aziz, Simon Mackenzie

Published: 2020-03-20

Abstract

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.