[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 …
Fairrec: Two-sided fairness for personalized recommendations in two-sided platforms
We investigate the problem of fair recommendation in the context of two-sided online
platforms, comprising customers on one side and producers on the other. Traditionally …
platforms, comprising customers on one side and producers on the other. Traditionally …
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 …
The unreasonable fairness of maximum Nash welfare
The maximum Nash welfare (MNW) solution—which selects an allocation that maximizes
the product of utilities—is known to provide outstanding fairness guarantees when allocating …
the product of utilities—is known to provide outstanding fairness guarantees when allocating …
Finding fair and efficient allocations
We study the problem of allocating a set of indivisible goods among a set of agents in a fair
and efficient manner. An allocation is said to be fair if it is envy-free up to one good (EF1) …
and efficient manner. An allocation is said to be fair if it is envy-free up to one good (EF1) …
EFX exists for three agents
We study the problem of distributing a set of indivisible goods among agents with additive
valuations in a fair manner. The fairness notion under consideration is envy-freeness up to …
valuations in a fair manner. The fairness notion under consideration is envy-freeness up to …
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 …
Fair enough: Guaranteeing approximate maximin shares
D Kurokawa, AD Procaccia, J Wang - Journal of the ACM (JACM), 2018 - dl.acm.org
We consider the problem of fairly allocating indivisible goods, focusing on a recently
introduced notion of fairness called maximin share guarantee: each player's value for his …
introduced notion of fairness called maximin share guarantee: each player's value for his …
Maximum Nash welfare and other stories about EFX
We consider the classic problem of fairly allocating indivisible goods among agents with
additive valuation functions and explore the connection between two prominent fairness …
additive valuation functions and explore the connection between two prominent fairness …
Fair allocation of indivisible goods and chores
We consider the problem of fairly dividing a set of indivisible items. Much of the fair division
literature assumes that the items are “goods” that yield positive utility for the agents. There is …
literature assumes that the items are “goods” that yield positive utility for the agents. There is …