Fair allocation of a multiset of indivisible items

by   Pranay Gorantla, et al.

We study the problem of allocating a set M of m indivisible items among n agents in a fair manner. We consider two well-studied notions of fairness: envy-freeness (EF), and envy-freeness up to any good (EFX). While it is known that complete EF allocations do not always exist, it is not known if complete EFX allocations exist besides a few cases. In this work, we reformulate the problem to allow M to be a multiset. Specifically, we introduce a parameter t for the number of distinct types of items, and study allocations of multisets that contain items of these t types. We show the following: 1. For arbitrary n, t, a complete EF allocation exists when agents have distinct additive valuations, and there are enough items of each type. 2. For arbitrary n, m, t, a complete EFX allocation exists when agents have additive valuations with identical preferences. 3. For arbitrary n, m, and t≤2, a complete EFX allocation exists when agents have additive valuations. For 2 and 3, our approach is constructive; we give a polynomial-time algorithm to find a complete EFX allocation.


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 ...

Envy-free Relaxations for Goods, Chores, and Mixed Items

In fair division problems, we are given a set S of m items and a set N o...

EFX Exists for Four Agents with Three Types of Valuations

In this paper, we address the problem of determining an envy-free alloca...

On Fair Division under Heterogeneous Matroid Constraints

We study fair allocation of indivisible goods among additive agents with...

Fairly Allocating (Contiguous) Dynamic Indivisible Items with Few Adjustments

We study the problem of dynamically allocating indivisible items to a gr...

Equitable Allocations of Indivisible Chores

We study fair allocation of indivisible chores (i.e., items with non-pos...

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...

Please sign up or login with your details

Forgot password? Click here to reset