… We find that all cake-cutting procedures are very frequently manipulated, in fact at least half
… This is because subjects use that knowledge to manipulate the cake-cutting procedures in …

… Fair Division treats all these problems and many more … cake-cutting procedure,'I cut, you
choose', the authors show how it has been adapted in a number of fields and then analyze fair-…

… There are numerous papers about fair division in general and fair cake-cutting in particular.
We mentioned some of them in the introduction. Here we survey some work that is more …

… Surveys on the theory of cake-cutting algorithms can be found in [11, 13, 14, 37, 44, 45].
Below we focus on the more practice-oriented works on fair division. These can be categorized …

Using a lab experiment, we investigate the real-life performance of envy-free and proportional
cake-cutting procedures with respect to fairness and preference manipulation. We find that …

… When taking cake-cutting protocols into practice, runtime efficiency is an important factor. It
is not sufficient to just know whether a protocol will provide a division with certain properties, …

… To deploy cake cutting mechanisms in practice, it leaves us to consider relaxations on
truthfulness or proportionality. In the theorem below, we show the non-existence of approximately …

… a land-plot that he or she considers a fair share? The answer to the question can be based
on the application of the solution to the classic problem of fair cake-cutting. In this problem, an …

… We show that well known fair division procedures like cut-and-choose and the Dubins-… cake
cutting procedures. Based on its resistance to collusion, and its good performance in practice…

… We focus on the most common setting: fair cake-cutting. … rich protocols while assuming
queries that are realistic to implement in practice. Introduced by Robertson and Webb [1998] and …