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...

Full description

Saved in:
Bibliographic Details
Published in:Operations research letters Vol. 48; no. 5; pp. 573 - 578
Main Authors: Aziz, Haris, Moulin, Hervé, Sandomirskiy, Fedor
Format: Journal Article
Language:English
Published: Elsevier B.V 01.09.2020
Subjects:
Fair division
Pareto optimality
Proportionality
Pareto optimality
Fair division
Proportionality
ISSN:0167-6377, 1872-7468
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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