[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 …
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 …
Gradient driven rewards to guarantee fairness in collaborative machine learning
In collaborative machine learning (CML), multiple agents pool their resources (eg, data)
together for a common learning task. In realistic CML settings where the agents are self …
together for a common learning task. In realistic CML settings where the agents are self …
Almost envy-freeness with general valuations
B Plaut, T Roughgarden - SIAM Journal on Discrete Mathematics, 2020 - SIAM
The goal of fair division is to distribute resources among competing players in a “fair" way.
Envy-freeness is the most extensively studied fairness notion in fair division. Envy-free …
Envy-freeness is the most extensively studied fairness notion in fair division. Envy-free …
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) …
The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes
E Budish - Journal of Political Economy, 2011 - journals.uchicago.edu
This paper proposes a new mechanism for combinatorial assignment—for example,
assigning schedules of courses to students—based on an approximation to competitive …
assigning schedules of courses to students—based on an approximation to competitive …
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 …
Constraints in fair division
W Suksompong - ACM SIGecom Exchanges, 2021 - dl.acm.org
The fair allocation of resources to interested agents is a fundamental problem in society.
While the majority of the fair division literature assumes that all allocations are feasible, in …
While the majority of the fair division literature assumes that all allocations are feasible, in …