Fair division with multiple pieces
Kathryn Nyman, Francis Edward Su, Shira Zerbib

TL;DR
This paper investigates envy-free division problems involving multiple pieces and provides bounds on the number of players who can be satisfied with their desired allocations in various settings, using topological and hypergraph theory methods.
Contribution
It introduces new bounds and existence results for envy-free allocations in multi-piece division problems, extending classical fair division theory.
Findings
Existence of allocations where a fraction of players get their desired pieces.
Bounds depend on the number of players, pieces, and divisions.
Use of topological and hypergraph theorems to prove results.
Abstract
Given a set of players we consider problems concerning envy-free allocation of collections of pieces from a given set of goods or chores. We show that if and each player can choose pieces out of pieces of a cake, then there exist a division of the cake and an allocation of the pieces where at least players get their desired pieces each. We further show that if and each player can choose pieces, one from each of cakes that are divided into pieces each, then there exist a division of the cakes and allocation of the pieces where at least players get their desired pieces. Finally we prove that if and each player can choose one shift in each of days that are partitioned into shifts each, then, given that the salaries of the players are fixed, there exist $n(1+\ln…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
