# Fair division with multiple pieces

@article{Nyman2020FairDW,
title={Fair division with multiple pieces},
author={Kathryn L. Nyman and F. Su and Shira Zerbib},
journal={Discret. Appl. Math.},
year={2020},
volume={283},
pages={115-122}
}
• Published 2020
• Mathematics, Computer Science
• Discret. Appl. Math.
• Given a set of $p$ players we consider problems concerning envy-free allocation of collections of $k$ pieces from a given set of goods or chores. We show that if $p\le n$ and each player can choose $k$ pieces out of $n$ pieces of a cake, then there exist a division of the cake and an allocation of the pieces where at least $\frac{p}{2(k^2-k+1)}$ players get their desired $k$ pieces each. We further show that if $p\le k(n-1)+1$ and each player can choose $k$ pieces, one from each of $k$ cakes… CONTINUE READING

BLOG POST

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES
Fair division - from cake-cutting to dispute resolution
• Political Science, Computer Science
• 1996
• 905
• PDF
Two-player envy-free multi-cake division
• Mathematics, Computer Science
• 2010
• 11
• PDF
Cake-cutting algorithms - be fair if you can
• Computer Science, Mathematics
• 1998
• 351
• PDF
Transversals of d-Intervals
• 46
• PDF
On Balanced Games Without Side Payments
• 137
• Highly Influential
• PDF
A Polytopal Generalization of Sperner's Lemma
• Mathematics, Computer Science
• 2002
• 43
• PDF