Envy-Free Cake Divisions Cannot be Found by Finite Protocols

Abstract

We show that no finite protocol (even if unbounded) can guarantee an envy-free division of a cake among three or more players, if each player is to receive a single connected piece.