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...

The form of contests for a single fixed prize can be determined by a designer who maximizes the contestants' efforts. This paper establishes that, under common knowledge of the two asymmetric contestants' prize valuations, a fair Tullock-type endogenously determined lottery is always superior to...

The form of contests for a single fixed prize can be determined by a designer who maximizes the contestants' efforts. This paper establishes that, under common knowledge of the two asymmetric contestants' prize valuations, a fair Tullock-type endogenously determined lottery is always superior to...