Almost Envy-Freeness in Group Resource Allocation

01/24/2019
by   Maria Kyropoulou, et al.
0

We study the problem of fairly allocating indivisible goods between groups of agents using the recently introduced relaxations of envy-freeness. We consider the existence of fair allocations under different assumptions on the valuations of the agents. In particular, our results cover cases of arbitrary monotonic, responsive, and additive valuations, while for the case of binary valuations we fully characterize the cardinalities of two groups of agents for which a fair allocation can be guaranteed with respect to both envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX). Moreover, we introduce a new model where the agents are not partitioned into groups in advance, but instead the partition can be chosen in conjunction with the allocation of the goods. In this model, we show that for agents with arbitrary monotonic valuations, there is always a partition of the agents into two groups of any given sizes along with an EF1 allocation of the goods. We also provide an extension of this result to any number of groups.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/08/2017

Democratic Fair Allocation of Indivisible Goods

We study the problem of fairly allocating indivisible goods to groups of...
research
07/30/2018

Fairly Allocating Many Goods with Few Queries

We investigate the query complexity of the fair allocation of indivisibl...
research
05/22/2020

Cooperation in Small Groups – an Optimal Transport Approach

If agents cooperate only within small groups of some bounded sizes, is t...
research
01/17/2020

A note on the rationing of divisible and indivisible goods in a general network

The study of matching theory has gained importance recently with applica...
research
05/28/2020

Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation

We study the problem of allocating indivisible goods among agents with a...
research
05/04/2021

Almost Envy-Freeness for Groups: Improved Bounds via Discrepancy Theory

We study the allocation of indivisible goods among groups of agents usin...
research
05/22/2022

Lotteries for Shared Experiences

We study a setting where tickets for an experience are allocated by lott...

Please sign up or login with your details

Forgot password? Click here to reset