Equitable Allocations of Mixtures of Goods and Chores
Hadi Hosseini, Aditi Sethia

TL;DR
This paper studies equitable allocation of mixed goods and chores, revealing computational challenges and providing algorithms for specific valuation cases, advancing understanding of fairness in complex allocation scenarios.
Contribution
It introduces new algorithms for EQ1 allocations with mixed items under various valuation models, and shows computational intractability in certain cases, extending fairness theory.
Findings
EQ1 may not exist for mixed items in some cases.
Efficient algorithms are provided for specific valuation classes.
Progress is made in computing EQX allocations for subjective valuations.
Abstract
Equitable allocation of indivisible items involves partitioning the items among agents such that everyone derives (almost) equal utility. We consider the approximate notion of \textit{equitability up to one item} (EQ1) and focus on the settings containing mixtures of items (goods and chores), where an agent may derive positive, negative, or zero utility from an item. We first show that -- in stark contrast to the goods-only and chores-only settings -- an EQ1 allocation may not exist even for additive bivalued instances, and its corresponding decision problem is computationally intractable. We focus on a natural domain of normalized valuations where the value of the entire set of items is constant for all agents. On the algorithmic side, we show that an EQ1 allocation can be computed efficiently for (i) normalized valuations, (ii) objective but non-normalized…
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.
