DeepAI AI Chat
Log In Sign Up

Achieving Proportionality up to the Maximin Item with Indivisible Goods

by   Artem Baklanov, et al.

We study the problem of fairly allocating indivisible goods and focus on the classic fairness notion of proportionality. The indivisibility of the goods is long known to pose highly non-trivial obstacles to achieving fairness, and a very vibrant line of research has aimed to circumvent them using appropriate notions of approximate fairness. Recent work has established that even approximate versions of proportionality (PROPx) may be impossible to achieve even for small instances, while the best known achievable approximations (PROP1) are much weaker. We introduce the notion of proportionality up to the maximin item (PROPm) and show how to reach an allocation satisfying this notion for any instance involving up to five agents with additive valuations. PROPm provides a well motivated middle-ground between PROP1 and PROPx, while also capturing some elements of the well-studied maximin share (MMS) benchmark: another relaxation of proportionality that has attracted a lot of attention.


page 1

page 2

page 3

page 4


Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average

We study the problem of fairly allocating a set of indivisible goods to ...

Groupwise Maximin Fair Allocation of Indivisible Goods

We study the problem of allocating indivisible goods among n agents in a...

PROPm Allocations of Indivisible Goods to Multiple Agents

We study the classic problem of fairly allocating a set of indivisible g...

Comparing Approximate Relaxations of Envy-Freeness

In fair division problems with indivisible goods it is well known that o...

Approximately EFX Allocations for Indivisible Chores

In this paper we study how to fairly allocate a set of m indivisible cho...

Mind the Gap: Cake Cutting With Separation

We study the problem of fairly allocating a divisible resource, also kno...