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 …
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 …
[HTML][HTML] Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination
G Amanatidis, E Markakis, A Ntokos - Theoretical Computer Science, 2020 - Elsevier
Several relaxations of envy-freeness, tailored to fair division in settings with indivisible
goods, have been introduced within the last decade. Due to the lack of general existence …
goods, have been introduced within the last decade. Due to the lack of general existence …
Approximating Nash social welfare under submodular valuations through (un) matchings
We study the problem of approximating maximum Nash social welfare (NSW) when
allocating m indivisible items among n asymmetric agents with submodular valuations. The …
allocating m indivisible items among n asymmetric agents with submodular valuations. The …
Fair algorithms for multi-agent multi-armed bandits
We propose a multi-agent variant of the classical multi-armed bandit problem, in which there
are $ N $ agents and $ K $ arms, and pulling an arm generates a (possibly different) …
are $ N $ agents and $ K $ arms, and pulling an arm generates a (possibly different) …
Fair and efficient allocations under subadditive valuations
We study the problem of allocating a set of indivisible goods among agents with subadditive
valuations in a fair and efficient manner. Envy-Freeness up to any good (EFX) is the most …
valuations in a fair and efficient manner. Envy-Freeness up to any good (EFX) is the most …
Improving Nash social welfare approximations
P McGlaughlin, J Garg - Journal of Artificial Intelligence Research, 2020 - jair.org
We consider the problem of fairly allocating a set of indivisible goods among n agents.
Various fairness notions have been proposed within the rapidly growing field of fair division …
Various fairness notions have been proposed within the rapidly growing field of fair division …
Auction algorithms for market equilibrium with weak gross substitute demands
We consider the Arrow--Debreu exchange market model under the assumption that the
agents' demands satisfy the weak gross substitutes (WGS) property. We present a simple …
agents' demands satisfy the weak gross substitutes (WGS) property. We present a simple …
Two birds with one stone: Fairness and welfare via transfers
We study the question of dividing a collection of indivisible items amongst a set of agents.
The main objective of research in the area is to achieve one of two goals: fairness or …
The main objective of research in the area is to achieve one of two goals: fairness or …
[HTML][HTML] Allocation of indivisible items with individual preference graphs
This paper studies the allocation of indivisible items to agents, when each agent's
preferences are expressed by means of a directed acyclic graph. The vertices of each …
preferences are expressed by means of a directed acyclic graph. The vertices of each …