DeepAI AI Chat
Log In Sign Up

Fairness Concepts for Indivisible Items with Externalities

10/18/2021
by   Haris Aziz, et al.
0

We study a fair allocation problem of indivisible items under additive externalities in which each agent also receives values from items that are assigned to other agents. We propose several new fairness concepts. We extend the well-studied envy-freeness up to one item (EF1) and envy-freeness up to any item (EFX) to this setting, and we propose a new fairness concept called general fair share (GFS). We undertake a detailed study and present algorithms for finding fair allocations.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/20/2020

Existence of EFX for Two Additive Valuations

Fair division of indivisible items is a well-studied topic in Economics ...
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'...
05/11/2023

Fair Division of a Graph into Compact Bundles

We study the computational complexity of fair division of indivisible it...
05/21/2022

Fair Allocation of Indivisible Chores: Beyond Additive Valuations

In this work, we study the maximin share (MMS) fair allocation of indivi...
07/04/2022

Repeatedly Matching Items to Agents Fairly and Efficiently

We consider a novel setting where a set of items are matched to the same...
05/22/2022

On the Price of Fairness of Allocating Contiguous Blocks

In this work, we revisit the problem of fairly allocating a number of in...
06/14/2020

Group Fairness for Knapsack Problems

We study the knapsack problem with group fairness constraints. The input...