Abstract

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 cake-cutting applications, notably in urban and agricultural economics… (More)

Topics

12 Figures and Tables

Slides referencing similar topics