2 citations · 2 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
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…