Back to Search
Start Over
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
- Publication Year :
- 2020
- Publisher :
- arXiv, 2020.
-
Abstract
- We study the fair allocation of undesirable indivisible items, or chores. While the case of desirable indivisible items (or goods) is extensively studied, with many results known for different notions of fairness, less is known about the fair division of chores. We study the envy-free division of chores, and make three contributions. First, we show that determining the existence of an envy-free allocation is NP-complete, even in the simple case when agents have binary additive valuations. Second, we provide a polynomial-time algorithm for computing an allocation that satisfies envy-freeness up to one chore (EF1), correcting an existing proof in the literature. A straightforward modification of our algorithm can be used to compute an EF1 allocation for doubly monotone instances (wherein each agent can partition the set of items into objective goods and objective chores). Our third result applies to a mixed resources model consisting of indivisible items and a divisible, undesirable heterogeneous resource (i.e., a bad cake). We show that there always exists an allocation that satisfies envy-freeness for mixed resources (EFM) in this setting, complementing a recent result of Bei et al. (Art. Int. 2021) for indivisible goods and divisible cake.<br />Comment: v2 to v3 incorporates changes suggested by reviewers. Accepted at APPROX 2021
- Subjects :
- FOS: Computer and information sciences
Theory of computation → Algorithmic game theory
Computer Science - Computer Science and Game Theory
Fair Division
Theory of computation → Exact and approximate computation of equilibria
Approximate Envy-Freeness
Mathematics of computing → Combinatorial algorithms
Indivisible Chores
Computer Science and Game Theory (cs.GT)
Subjects
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....4e28952de4ff2ea7eea5662b5209f2f1
- Full Text :
- https://doi.org/10.48550/arxiv.2012.06788