Mathematical Sciences Research Institute

Home » Workshop » Schedules » Cutting Cakes with Combinatorial Fixed Point Theorems

Cutting Cakes with Combinatorial Fixed Point Theorems

Introductory Workshop: Geometric and Topological Combinatorics September 05, 2017 - September 08, 2017

September 07, 2017 (03:30 PM PDT - 04:30 PM PDT)
Speaker(s): Kathryn Nyman (Willamette University)
Location: MSRI: Simons Auditorium
  • Sperner's Lemma

  • Cake cutting

Primary Mathematics Subject Classification
Secondary Mathematics Subject Classification No Secondary AMS MSC



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. 

Supplements No Notes/Supplements Uploaded
Video/Audio Files


H.264 Video 14-Nyman.mp4 106 MB video/mp4 rtsp://videos.msri.org/data/000/029/366/original/14-Nyman.mp4 Download
Troubles with video?

Please report video problems to itsupport@msri.org.

See more of our Streaming videos on our main VMath Videos page.