
On the Complexity of Fair House Allocation
We study fairness in house allocation, where m houses are to be allocate...
read it

On Democratic Fairness for Groups of Agents
We study the problem of allocating indivisible goods to groups of intere...
read it

Approximating Maximin Shares with Mixed Manna
We initiate the study of fair allocations of a mixed manna under the pop...
read it

On the Number of Almost EnvyFree Allocations
Envyfreeness is a standard benchmark of fairness in resource allocation...
read it

Almost EnvyFreeness in Group Resource Allocation
We study the problem of fairly allocating indivisible goods between grou...
read it

PROPm Allocations of Indivisible Goods to Multiple Agents
We study the classic problem of fairly allocating a set of indivisible g...
read it

Maximum Weighted Loss Discrepancy
Though machine learning algorithms excel at minimizing the average loss ...
read it
Almost EnvyFreeness for Groups: Improved Bounds via Discrepancy Theory
We study the allocation of indivisible goods among groups of agents using wellknown fairness notions such as envyfreeness and proportionality. While these notions cannot always be satisfied, we provide several bounds on the optimal relaxations that can be guaranteed. For instance, our bounds imply that when the number of groups is constant and the n agents are divided into groups arbitrarily, there exists an allocation that is envyfree up to Θ(√(n)) goods, and this bound is tight. Moreover, we show that while such an allocation can be found efficiently, it is NPhard to compute an allocation that is envyfree up to o(√(n)) goods even when a fully envyfree allocation exists. Our proofs make extensive use of tools from discrepancy theory.
READ FULL TEXT
Comments
There are no comments yet.