2 papers
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.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…