Cake cutting problems

Gerhard J. Wëginger (UT & TU/e)

In the cake cutting problem, n persons want to share a common piece of property so that each of them is "satisfied". The talk surveys a number of basic results from the cake cutting literature (notion of fairness and envy-freeness; excistence results; continuous protocols, discrete protocols; lower bound techniques).

back to TU/e Combinatorial Theory Seminar announcements