
Approximately EFX Allocations for Indivisible Chores
In this paper we study how to fairly allocate a set of m indivisible cho...
read it

MaximinAware Allocations of Indivisible Goods
We study envyfree allocations of indivisible goods to agents in setting...
read it

Achieving Proportionality up to the Maximin Item with Indivisible Goods
We study the problem of fairly allocating indivisible goods and focus on...
read it

Almost Proportional Allocations for Indivisible Chores
In this paper, we consider how to fairly allocate m indivisible chores t...
read it

Improving EFX Guarantees through Rainbow Cycle Number
We study the problem of fairly allocating a set of indivisible goods amo...
read it

Maximin Fairness with Mixed Divisible and Indivisible Goods
We study fair resource allocation when the resources contain a mixture o...
read it

Almost EnvyFreeness for Groups: Improved Bounds via Discrepancy Theory
We study the allocation of indivisible goods among groups of agents usin...
read it
PROPm Allocations of Indivisible Goods to Multiple Agents
We study the classic problem of fairly allocating a set of indivisible goods among a group of agents, and focus on the notion of approximate proportionality known as PROPm. Prior work showed that there exists an allocation that satisfies this notion of fairness for instances involving up to five agents, but fell short of proving that this is true in general. We extend this result to show that a PROPm allocation is guaranteed to exist for all instances, independent of the number of agents or goods. Our proof is constructive, providing an algorithm that computes such an allocation and, unlike prior work, the running time of this algorithm is polynomial in both the number of agents and the number of goods.
READ FULL TEXT
Comments
There are no comments yet.