ENVY-FREE DIVISION VIA CONFIGURATION SPACES

Abstract

The classical approach to envy-free division and equilibrium problems arising in mathematical economics typically relies on Knaster– Kuratowski–Mazurkiewicz theorem, Sperner’s lemma or some extension involving mapping degree. We propose a different and relatively novel approach where the emphasis is on configuration spaces and equivariant topology, originally developed for applications in discrete and computational geometry (Tverberg type problems, necklace splitting problem, etc.). We illustrate the method by proving several counterparts and extensions of the classical envy-free division theorem of David Gale, where the emphasis is on preferences allowing the players to choose degenerate pieces of the cake.