Mind the Gap: Cake Cutting With Separation

by   Edith Elkind, et al.

We study the problem of fairly allocating a divisible resource, also known as cake cutting, with an additional requirement that the shares that different agents receive should be sufficiently separated from one another. This captures, for example, constraints arising from social distancing guidelines. While it is sometimes impossible to allocate a proportional share to every agent under the separation requirement, we show that the well-known criterion of maximin share fairness can always be attained. We then establish several computational properties of maximin share fairness – for instance, the maximin share of an agent cannot be computed exactly by any finite algorithm, but can be approximated with an arbitrarily small error. In addition, we consider the division of a pie (i.e., a circular cake) and show that an ordinal relaxation of maximin share fairness can be achieved.


page 1

page 2

page 3

page 4


Graphical Cake Cutting via Maximin Share

We study the recently introduced cake-cutting setting in which the cake ...

Keep Your Distance: Land Division With Separation

This paper is part of an ongoing endeavor to bring the theory of fair di...

Maximin share allocations on cycles

The problem of fair division of indivisible goods is a fundamental probl...

Strategyproof and Approximately Maxmin Fair Share Allocation of Chores

We initiate the work on fair and strategyproof allocation of indivisible...

Obvious Manipulations in Cake-Cutting

In cake-cutting, strategy-proofness is a very costly requirement in term...

A tight negative example for MMS fair allocations

We consider the problem of allocating indivisible goods to agents with a...

Achieving Proportionality up to the Maximin Item with Indivisible Goods

We study the problem of fairly allocating indivisible goods and focus on...