activity
20172022
most citedFair mixing: the case of dichotomous preferences

20 citations · 32 across the 2 of their papers we have counts for

collaborators
Showing cs.GTShow all

5 papers · 1 filter

cs.GT202212 cited

Algorithmic Fair Allocation of Indivisible Items: A Survey and New Questions

Haris Aziz, Bo Li, Herve Moulin +1

The theory of algorithmic fair allocation is within the center of multi-agent systems and economics in the last decade due to its industrial and social importance. At a high level,…

cs.GT2019

A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation

Haris Aziz, Herve Moulin, Fedor Sandomirskiy

We consider fair allocation of indivisible items under additive utilities. When the utilities can be negative, the existence and complexity of an allocation that satisfies Pareto o…

cs.GT2019

On the fair division of a random object

Anna Bogomolnaia, Herve Moulin, Fedor Sandomirskiy

Ann likes oranges much more than apples; Bob likes apples much more than oranges. Tomorrow they will receive one fruit that will be an orange or an apple with equal probability. Gi…

cs.GT201720 cited

Fair mixing: the case of dichotomous preferences

Haris Aziz, Anna Bogomolnaia, Herve Moulin

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a v…

cs.GT2017

Competitive division of a mixed manna

Anna Bogomolnaia, Herve Moulin, Fedor Sandomirskiy +1

A mixed manna contains goods (that everyone likes), bads (that everyone dislikes), as well as items that are goods to some agents, but bads or satiated to others. If all items are…