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

We consider fair allocation of indivisible items under additive utilities. We show that there exists a strongly polynomial-time algorithm that always computes an allocation satisfying Pareto optimality and proportionality up to one item even if the utilities are mixed and the agents have asymmetric...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research letters Jg. 48; H. 5; S. 573 - 578
Hauptverfasser: Aziz, Haris, Moulin, Hervé, Sandomirskiy, Fedor
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.09.2020
Schlagworte:
Fair division
Pareto optimality
Proportionality
Pareto optimality
Fair division
Proportionality
ISSN:0167-6377, 1872-7468
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider fair allocation of indivisible items under additive utilities. We show that there exists a strongly polynomial-time algorithm that always computes an allocation satisfying Pareto optimality and proportionality up to one item even if the utilities are mixed and the agents have asymmetric weights. The result does not hold if either of Pareto optimality or PROP1 is replaced with slightly stronger concepts.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2020.07.005