The classic fair cake-cutting problem [Steinhaus, 1948] is extended by introducing geometric constraints on the allocated pieces. Specifically, agents may demand to get their share as a square or a rectangle with a bounded length/width ratio. This is a plausible constraint in realistic...

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 nd that envy-free procedures, in particular Selfridge-Conway, are fairer and also are perceived as fairer than their...