DeepAI AI Chat
Log In Sign Up

Fairness Concepts for Indivisible Items with Externalities

by   Haris Aziz, et al.

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.


page 1

page 2

page 3

page 4


Existence of EFX for Two Additive Valuations

Fair division of indivisible items is a well-studied topic in Economics ...

Almost Group Envy-free Allocation of Indivisible Goods and Chores

We consider a multi-agent resource allocation setting in which an agent'...

Fair Division of a Graph into Compact Bundles

We study the computational complexity of fair division of indivisible it...

Fair Allocation of Indivisible Chores: Beyond Additive Valuations

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

Repeatedly Matching Items to Agents Fairly and Efficiently

We consider a novel setting where a set of items are matched to the same...

On the Price of Fairness of Allocating Contiguous Blocks

In this work, we revisit the problem of fairly allocating a number of in...

Group Fairness for Knapsack Problems

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