Cake cutting is a playful metaphor for an abstract mathematical setting that models fair division and conflict resolution. The settings concerns agents having different valuations over subsets of a single divisible resource (the cake) which is represented by an interval between 0 and 1. It is assumed the cake is infinitely divisible and agents' valuation of the union of two disjoint cake pieces is simply the sum of the valuations of the pieces. The field of cake cutting has been explored by mathematicians, computer scientists, economists, and political scientists. At least two prominent books have been written on the subject. Books on cake cutting The most central problem in cake cutting is to query the agents about their valuations of sub-intervals and use these answers to efficiently identify an envy-free allocation in which no agent prefers another agent's allocation. The solution to this problem has long been known for the case of two agents in ...
