## Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

# Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

 Mittagsseminar Talk Information

Date and Time: Thursday, May 05, 2011, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

The study of fair division problems is concerned with finding ways to divide an object among several parties according to some notion of fairness. In this talk, we follow a paper by Francis E. Su on envy-free division. Sperner's lemma is used to prove that, under certain assumptions, any cake can be divided among $n$ people such that each person believes their piece to be at least as big as any other piece. A constructive proof of Sperner's lemma gives an algorithm to find an approximate solution.