DeepAI AI Chat
Log In Sign Up

An Improved Envy-Free Cake Cutting Protocol for Four Agents

by   Georgios Amanatidis, et al.

We consider the classic cake-cutting problem of producing envy-free allocations, restricted to the case of four agents. The problem asks for a partition of the cake to four agents, so that every agent finds her piece at least as valuable as every other agent's piece. The problem has had an interesting history so far. Although the case of three agents is solvable with less than 15 queries, for four agents no bounded procedure was known until the recent breakthroughs of Aziz and Mackenzie (STOC 2016, FOCS 2016). The main drawback of these new algorithms, however, is that they are quite complicated and with a very high query complexity. With four agents, the number of queries required is close to 600. In this work we provide an improved algorithm for four agents, which reduces the current complexity by a factor of 3.4. Our algorithm builds on the approach of Aziz and Mackenzie (STOC 2016) by incorporating new insights and simplifying several steps. Overall, this yields an easier to grasp procedure with lower complexity.


page 1

page 2

page 3

page 4


A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents

We consider the well-studied cake cutting problem in which the goal is t...

Envy-Free Cake Cutting with Graph Constraints

We study the classic problem of fairly dividing a heterogeneous and divi...

A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees

We study the classic problem of fairly dividing a heterogeneous and divi...

Beyond Cake Cutting: Allocating Homogeneous Divisible Goods

The problem of fair division known as "cake cutting" has been the focus ...

Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents

We consider the ε-Consensus-Halving problem, in which a set of heterogen...

Cake-Cutting with Different Entitlements: How Many Cuts are Needed?

A cake has to be divided fairly among n agents. When all agents have equ...

Fair Cake Division Under Monotone Likelihood Ratios

This work develops algorithmic results for the classic cake-cutting prob...