[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 in the internet age
H Moulin - Annual Review of Economics, 2019 - annualreviews.org
Fair division, a key concern in the design of many social institutions, has for 70 years been
the subject of interdisciplinary research at the interface of mathematics, economics, and …
the subject of interdisciplinary research at the interface of mathematics, economics, and …
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 …
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 …
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 …
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) …
Fair enough: Guaranteeing approximate maximin shares
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 …
Approximation algorithms for maximin fair division
We consider the problem of allocating indivisible goods fairly among n agents who have
additive and submodular valuations for the goods. Our fairness guarantees are in terms of …
additive and submodular valuations for the goods. Our fairness guarantees are in terms of …
Fair allocation of indivisible goods: Improvements and generalizations
We study the problem of fair allocation for indivisible goods. We use the maxmin share
paradigm introduced by Budish~\citeBudish: first as a measure for fairness.\procacciafirst …
paradigm introduced by Budish~\citeBudish: first as a measure for fairness.\procacciafirst …
An improved approximation algorithm for maximin shares
J Garg, S Taki - Proceedings of the 21st ACM Conference on …, 2020 - dl.acm.org
We study the problem of fair allocation of m indivisible items among n agents with additive
valuations using the popular notion of maximin share (MMS) as our measure of fairness. An …
valuations using the popular notion of maximin share (MMS) as our measure of fairness. An …