BIE-VAK Selected Combinatorics Applications
Go to course navigation

8. How to Cut a Cake

In the beginning of the seventh seminar, we continued discussing combinatorial games. In the second half, we focused on the problem of fair cake cutting and briefly mentioned other topics from the theory of fair division.

Presentation

References

  1. BRANDT, Felix, Vincent CONITZER, Ulle ENDRIS, Jérôme LANG a Ariel D. PROCACCIA. Handbook of Computational Social Choice. New York, NY, USA: Cambridge University Press, 2016. ISBN 978-1-107-06043-2.
  2. ROBERTSON, Jack a William WEBB. Cake Cutting Algorithms: Be Fair if You Can. A K Peters/CRC Press, 1998. ISBN 978-1-568-81076-8.
  3. STEWART, Ian. How to cut a cake: and other mathematical conundrums. Oxford University Press, 2006. ISBN 978-0-199-20590-5.