# 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} }

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

#### Topics from this paper.

#### Paper Mentions

BLOG POST

7 Citations

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

Maximum degree and fractional matchings in uniform hypergraphs

- Mathematics, Computer Science
- 1981

- 129
- PDF