# A Discrete and Bounded Envy-free Cake Cutting Protocol for Four Agents

arXiv: https://arxiv.org/abs/1508.05143 · HTML: https://mlsanity.com/paper/1508.05143/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 Aug 2015.

## Built on by (most cited first, 4 of 4)

- [On the existence of EFX allocations in multigraphs](https://mlsanity.com/paper/2502.09777/) (2025)
- [Fair Division of Multi-layered Cakes](https://mlsanity.com/paper/2208.00726/) (2022)
- [Chore Cutting: Envy and Truth](https://mlsanity.com/paper/2301.09306/) (2023)
- [EFX Allocation In (Multi)Hypergraphs](https://mlsanity.com/paper/2608.03171/) (2026)

## Abstract (arXiv)

We consider the well-studied cake cutting problem in which the goal is to identify a fair allocation based on a minimal number of queries from the agents. The problem has attracted considerable attention within various branches of computer science, mathematics, and economics. Although, the elegant Selfridge-Conway envy-free protocol for three agents has been known since 1960, it has been a major open problem for the last fifty years to obtain a bounded envy-free protocol for more than three agents. We propose a discrete and bounded envy-free protocol for four agents.