Computing EF1 Allocations under Budget Constraints in Polynomial Time
Tingwei Hu, Lili Mei, Guochuan Zhang
Abstract
We study the fair allocation of indivisible items to agents with budget constraints and additive valuations. Each agent compares its own bundle with the subsets of another bundle that fit its budget. An allocation is envy-free up to one item (EF1) if, for every agent and every nonempty subset under comparison, removing an item of maximum value to that agent eliminates its envy. We require EF1 both between agents and towards the charity, which contains all unallocated items. EF1 allocations exist, but computing them in polynomial time has remained open even for homogeneous valuations. We resolve this problem with a polynomial-time algorithm for EF1 allocations under heterogeneous valuations. We also prove that detecting an EF1 violation is NP-complete. Equivalently, checking whether a given allocation is EF1 is coNP-complete. Finally, we give polynomial-time algorithms for envy-freeness up to any item (EFX) both when each agent's valuation is proportional to item size and when each agent has a fixed number of distinct positive item values. As an application, for homogeneous valuations and any >0, we obtain an EF1 allocation with at least a (1/2-) fraction of the maximum social welfare in time polynomial in the input length and 1/.
Create a lesson
Related papers
Path-Independent Deleveraging Rules
Christoph Schlegel, Akaki Mamageishvili
Sequential Contract Design for Budgeted Crowdsourcing
Michal Feldman, Vasilis Gkatzelis, Shaul Rosner et al.
Safe Subgame Resolving in Multiplayer Games
Boning Li, Longbo Huang
Closing Gaps in Temporal Fair Division for Chores
Nicholas Teh
Uniqueness, Proximity, and Scaling in Atomic Splittable Polymatroid Congestion Games
Tobias Harks
Distortion in Online Voting
MohammadHossein Ghasemi, Masoud Seddighin, Saeed Seddighin