Cake Cutting Algorithms
Oct 5, 2011
ABSTRACT: The problem of fairly dividing an infinitely divisible good (a.k.a. cake cutting) has been studied for the last 70 years by economists, mathematicians, and political scientists, but has been largely neglected by computer scientists. In spite of this (or maybe because of this) the field gives rise to many cool challenges for computer science, and especially for theoretical computer science. I will survey some classic results on cake cutting, and then present a fun open problem and my partial solution (and solicit the audience's help).