Cake Cutting: Fairness and Efficiency
Add to Google Calendar
p>Suppose you are a parent and you are going to divide a cake between your children. The cake is heterogeneous: different parts of the cake may have different toppings, and different children have different preferences on them. The objective is to make such division fair and efficient. Cake cutting is a fundamental problem in resource allocation, where cake is a metaphor for a heterogeneous divisible resource. The cake cutting problem has a long history, and has recently been studied in the computer science community.
This talk will focus on the cake cutting problem in a computer scientist's point of view. I will review several important and exciting results in this field, including some of my own results.