Research Repository

Almost Envy-Freeness in Group Resource Allocation

Kyropoulou, Maria and Suksompong, Warut and Voudouris, Alexandros A (2020) 'Almost Envy-Freeness in Group Resource Allocation.' Theoretical Computer Science. ISSN 0304-3975

[img]
Preview
Text
group-EF.revision.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (260kB) | Preview

Abstract

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.

Item Type: Article
Uncontrolled Keywords: Envy-freeness, Group fairness, Fair division, Resource allocation
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Elements
Date Deposited: 04 Aug 2020 14:59
Last Modified: 15 Jul 2021 01:00
URI: http://repository.essex.ac.uk/id/eprint/28254

Actions (login required)

View Item View Item