[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 …
Allocating indivisible goods to strategic agents: Pure nash equilibria and fairness
We consider the problem of fairly allocating a set of indivisible goods to a set of strategic
agents with additive valuation functions. We assume no monetary transfers, and therefore, a …
agents with additive valuation functions. We assume no monetary transfers, and therefore, a …
Fair Shares: Feasibility, Domination, and Incentives
We consider fair allocation of indivisible goods to n equally entitled agents. Every agent i
has a valuation function vi from some given class of valuation functions. A share s is a …
has a valuation function vi from some given class of valuation functions. A share s is a …
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 …
The frontier of intractability for EFX with two agents
We consider the problem of sharing a set of indivisible goods among agents in a fair
manner, namely such that the allocation is envy-free up to any good (EFX). We focus on the …
manner, namely such that the allocation is envy-free up to any good (EFX). We focus on the …
Incentive Ratios for Fairly Allocating Indivisible Goods: Simple Mechanisms Prevail
We study the problem of fairly allocating indivisible goods among strategic agents.
Amanatidis et al. show that truthfulness is incompatible with any meaningful fairness notions …
Amanatidis et al. show that truthfulness is incompatible with any meaningful fairness notions …
The Incentive Guarantees Behind Nash Welfare in Divisible Resources Allocation
We study the problem of allocating divisible resources among $ n $ agents, hopefully in a
fair and efficient manner. With the presence of strategic agents, additional incentive …
fair and efficient manner. With the presence of strategic agents, additional incentive …
Complexity of round-robin allocation with potentially noisy queries
We study the complexity of a fundamental algorithm for fairly allocating indivisible items, the
round-robin algorithm. For n agents and m items, we show that the algorithm can be …
round-robin algorithm. For n agents and m items, we show that the algorithm can be …
On Truthful Mechanisms without Pareto-efficiency: Characterizations and Fairness
M Babaioff, NM Morag - arxiv preprint arxiv:2411.11131, 2024 - arxiv.org
We consider the problem of allocating heterogeneous and indivisible goods among strategic
agents, with preferences over subsets of goods, when there is no medium of exchange. This …
agents, with preferences over subsets of goods, when there is no medium of exchange. This …
Fair division with interdependent values
We introduce the study of designing allocation mechanisms for fairly allocating indivisible
goods in settings with interdependent valuation functions. In our setting, there is a set of …
goods in settings with interdependent valuation functions. In our setting, there is a set of …