DeepAI AI Chat
Log In Sign Up

Almost Group Envy-free Allocation of Indivisible Goods and Chores

by   Haris Aziz, et al.
ENS Paris-Saclay

We consider a multi-agent resource allocation setting in which an agent's utility may decrease or increase when an item is allocated. We take the group envy-freeness concept that is well-established in the literature and present stronger and relaxed versions that are especially suitable for the allocation of indivisible items. Of particular interest is a concept called group envy-freeness up to one item (GEF1). We then present a clear taxonomy of the fairness concepts. We study which fairness concepts guarantee the existence of a fair allocation under which preference domain. For two natural classes of additive utilities, we design polynomial-time algorithms to compute a GEF1 allocation. We also prove that checking whether a given allocation satisfies GEF1 is coNP-complete when there are either only goods, only chores or both.


page 1

page 2

page 3

page 4


Fairness Concepts for Indivisible Items with Externalities

We study a fair allocation problem of indivisible items under additive e...

Fair and Efficient Resource Allocation with Externalities

In resource allocation, it is common to assume that agents have a utilit...

A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange

The rapid growth of wireless and mobile Internet has led to wide applica...

Developments in Multi-Agent Fair Allocation

Fairness is becoming an increasingly important concern when designing ma...

Unified Fair Allocation of Goods and Chores via Copies

We consider fair allocation of indivisible items in a model with goods, ...

Probabilistic Serial Mechanism for Multi-Type Resource Allocation

In multi-type resource allocation (MTRA) problems, there are p ≥ 2 types...

On Weighted Envy-Freeness in Indivisible Item Allocation

In this paper, we introduce and analyze new envy-based fairness concepts...