Cutting Cakes with Combinatorial Fixed Point Theorems
Introductory Workshop: Geometric and Topological Combinatorics September 05, 2017 - September 08, 2017
Location: MSRI: Simons Auditorium
Sperner's Lemma, a combinatorial analogue to Brower's Fixed Point Theorem, guarantees a "fully-labeled cell" in any labeled triangulation of the n-simplex meeting suitable conditions. These fully-labeled cells provide crisp solutions to envy-free cake-cutting questions. We look at equivalences between combinatorial results and topological fixed-point theorems, along with applications to fair division problems, including the division of multiple cakes and consensus halving.
Please report video problems to firstname.lastname@example.org.
See more of our Streaming videos on our main VMath Videos page.