Redividing the Cake

TL;DR

This paper develops algorithms for fair re-division of resources with existing ownership, balancing fairness and rights under various geometric constraints, and analyzes the associated social welfare loss.

Contribution

It introduces re-division algorithms that achieve different fairness-ownership trade-offs across multiple geometric settings, with implications for the price-of-fairness.

Findings

Algorithms for fair re-division under no constraints, connectivity, rectangularity, and convexity.

Upper bounds on the price-of-fairness for each geometric setting.

Trade-offs between fairness and ownership rights demonstrated through the algorithms.

Abstract

The paper considers fair allocation of resources that are already allocated in an unfair way. This setting requires a careful balance between the fairness considerations and the rights of the present owners. The paper presents re-division algorithms that attain various trade-off points between fairness and ownership rights, in various settings differing in the geometric constraints on the allotments: (a) no geometric constraints; (b) connectivity -- the cake is a one-dimensional interval and each piece must be a contiguous interval; (c) rectangularity -- the cake is a two-dimensional rectangle or rectilinear polygon and the pieces should be rectangles; (d) convexity -- the cake is a two-dimensional convex polygon and the pieces should be convex. These re-division algorithms have implications on another problem: the price-of-fairness -- the loss of social welfare caused by fairness requirements. Each algorithm implies an upper bound on the price-of-fairness with the respective geometric constraints.