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.
If none of the options work for you, you can always buy the DVD of this lecture. The videos are sold at cost for $20USD (shipping included). Please Click Here to send an email to MSRI to purchase the DVD.
See more of our Streaming videos on our main VMath - Streaming Video page.