DeepAI
Log In Sign Up

Unified Fair Allocation of Goods and Chores via Copies

09/17/2021
by   Yotam gafni, et al.
0

We consider fair allocation of indivisible items in a model with goods, chores, and copies, as a unified framework for studying: (1) the existence of EFX and other solution concepts for goods with copies; (2) the existence of EFX and other solution concepts for chores. We establish a tight relation between these issues via two conceptual contributions: First, a refinement of envy-based fairness notions that we term envy without commons (denoted when applied to EFX). Second, a formal duality theorem relating the existence of a host of (refined) fair allocation concepts for copies to their existence for chores. We demonstrate the usefulness of our duality result by using it to characterize the existence of EFX for chores through the dual environment, as well as to prove EFX existence in the special case of leveled preferences over the chores. We further study the hierarchy among envy-freeness notions without commons and their α-MMS guarantees, showing for example that any allocation guarantees at least 4/11-MMS for goods with copies.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/13/2021

Fair Allocation of Conflicting Items

We study fair allocation of indivisible items, where the items are furni...
03/14/2022

Fairly Dividing Mixtures of Goods and Chores under Lexicographic Preferences

We study fair allocation of indivisible goods and chores among agents wi...
09/17/2019

Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination

Several relaxations of envy-freeness, tailored to fair division in setti...
07/16/2019

Almost Group Envy-free Allocation of Indivisible Goods and Chores

We consider a multi-agent resource allocation setting in which an agent'...
12/05/2018

Chore division on a graph

The paper considers fair allocation of indivisible nondisposable items t...
11/13/2017

Fair Knapsack

We study the following multiagent variant of the knapsack problem. We ar...