Envy-free cake divisions cannot be found by finite protocols
Summary: 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.
scientific article; zbMATH DE number 5540916