[HTML][HTML] Fair division of indivisible goods: Recent progress and open questions
Allocating resources to individuals in a fair manner has been a topic of interest since ancient
times, with most of the early mathematical work on the problem focusing on resources that …
times, with most of the early mathematical work on the problem focusing on resources that …
Fair division of indivisible goods: A survey
Allocating resources to individuals in a fair manner has been a topic of interest since the
ancient times, with most of the early rigorous mathematical work on the problem focusing on …
ancient times, with most of the early rigorous mathematical work on the problem focusing on …
Algorithmic fair allocation of indivisible items: A survey and new questions
The theory of algorithmic fair allocation is at the center of multi-agent systems and
economics in recent decades due to its industrial and social importance. At a high level, the …
economics in recent decades due to its industrial and social importance. At a high level, the …
Best of both worlds: Ex ante and ex post fairness in resource allocation
We study the problem of allocating indivisible goods among agents with additive valuations.
When randomization is allowed, it is possible to achieve compelling notions of fairness such …
When randomization is allowed, it is possible to achieve compelling notions of fairness such …
Weighted envy-freeness in indivisible item allocation
We introduce and analyze new envy-based fairness concepts for agents with weights that
quantify their entitlements in the allocation of indivisible items. We propose two variants of …
quantify their entitlements in the allocation of indivisible items. We propose two variants of …
Mixed fair division: A survey
The fair allocation of resources to agents is a fundamental problem in society and has
received significant attention and rapid developments from the game theory and artificial …
received significant attention and rapid developments from the game theory and artificial …
Almost (Weighted) Proportional Allocations for Indivisible Chores✱✱
In this paper, we study how to fairly allocate a set of indivisible chores to a number of
(asymmetric) agents with additive cost functions. We consider the fairness notion of …
(asymmetric) agents with additive cost functions. We consider the fairness notion of …
Explainable and efficient randomized voting rules
S Ebadian, A Filos-Ratsikas… - Advances in Neural …, 2024 - proceedings.neurips.cc
With a rapid growth in the deployment of AI tools for making critical decisions (or aiding
humans in doing so), there is a growing demand to be able to explain to the stakeholders …
humans in doing so), there is a growing demand to be able to explain to the stakeholders …
Weighted EF1 allocations for indivisible chores
We study how to fairly allocate a set of indivisible chores to a group of agents, where each
agent $ i $ has a non-negative weight $ w_i $ that represents its obligation for undertaking …
agent $ i $ has a non-negative weight $ w_i $ that represents its obligation for undertaking …
On optimal tradeoffs between EFX and nash welfare
A major problem in fair division is how to allocate a set of indivisible resources among
agents fairly and efficiently. The goal of this work is to characterize the tradeoffs between two …
agents fairly and efficiently. The goal of this work is to characterize the tradeoffs between two …