2 citations · 2 across the 4 of their papers we have counts for
6 papers
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…
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…
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…
Dividing goods and bads under additive utilities
Anna Bogomolnaia, Herve Moulin, Fedor Sandomirskiy +1
When utilities are additive, we uncovered in our previous paper (Bogomolnaia et al. "Dividing Goods or Bads under Additive Utilities") many similarities but also surprising differe…
Dividing goods or bads under additive utilities
Anna Bogomolnaia, Herve Moulin, Fedor Sandomirskiy +1
We compare the Egalitarian Equivalent and the Competitive Equilibrium with Equal Incomes rules to divide a bundle of goods (heirlooms) or a bundle of bads (chores). For goods the C…
On repeated zero-sum games with incomplete information and asymptotically bounded values
Fedor Sandomirskiy
We consider repeated zero-sum games with incomplete information on the side of Player 2 with the total payoff given by the non-normalized sum of stage gains. In the classical examp…