Finding the Pareto Optimal Equitable Allocation of Homogeneous Divisible Goods Among Three Players

We consider the allocation of a finite number of homogeneous divisible items among three players. Under the assumption that each player assigns a positive value to every item, we develop a simple algorithm that returns a Pareto optimal and equitable allocation. This is based on the tight relationshi...

Full description

Bibliographic Details
Main Authors: Marco Dall'Aglio, Camilla Di Luca, Lucia Milone
Format: Article
Language:English
Published: Wrocław University of Science and Technology 2017-01-01
Series:Operations Research and Decisions
Online Access:http://orduser.pwr.wroc.pl/DownloadFile.aspx?aid=1330
id doaj-685a08aa8a8e407d865285a581c67367
record_format Article
spelling doaj-685a08aa8a8e407d865285a581c673672020-11-24T21:06:33ZengWrocław University of Science and TechnologyOperations Research and Decisions2081-88582391-60602017-01-01vol. 27no. 33550171491018Finding the Pareto Optimal Equitable Allocation of Homogeneous Divisible Goods Among Three PlayersMarco Dall'Aglio0Camilla Di Luca1Lucia Milone2LUISS University, ItalyLUISS University, ItalyLUISS University, ItalyWe consider the allocation of a finite number of homogeneous divisible items among three players. Under the assumption that each player assigns a positive value to every item, we develop a simple algorithm that returns a Pareto optimal and equitable allocation. This is based on the tight relationship between two geometric objects of fair division: The Individual Pieces Set (IPS) and the Radon-Nykodim Set (RNS). The algorithm can be considered as an extension of the Adjusted Winner procedure by Brams and Taylor to the three-player case, without the guarantee of envy-freeness. (original abstract)http://orduser.pwr.wroc.pl/DownloadFile.aspx?aid=1330
collection DOAJ
language English
format Article
sources DOAJ
author Marco Dall'Aglio
Camilla Di Luca
Lucia Milone
spellingShingle Marco Dall'Aglio
Camilla Di Luca
Lucia Milone
Finding the Pareto Optimal Equitable Allocation of Homogeneous Divisible Goods Among Three Players
Operations Research and Decisions
author_facet Marco Dall'Aglio
Camilla Di Luca
Lucia Milone
author_sort Marco Dall'Aglio
title Finding the Pareto Optimal Equitable Allocation of Homogeneous Divisible Goods Among Three Players
title_short Finding the Pareto Optimal Equitable Allocation of Homogeneous Divisible Goods Among Three Players
title_full Finding the Pareto Optimal Equitable Allocation of Homogeneous Divisible Goods Among Three Players
title_fullStr Finding the Pareto Optimal Equitable Allocation of Homogeneous Divisible Goods Among Three Players
title_full_unstemmed Finding the Pareto Optimal Equitable Allocation of Homogeneous Divisible Goods Among Three Players
title_sort finding the pareto optimal equitable allocation of homogeneous divisible goods among three players
publisher Wrocław University of Science and Technology
series Operations Research and Decisions
issn 2081-8858
2391-6060
publishDate 2017-01-01
description We consider the allocation of a finite number of homogeneous divisible items among three players. Under the assumption that each player assigns a positive value to every item, we develop a simple algorithm that returns a Pareto optimal and equitable allocation. This is based on the tight relationship between two geometric objects of fair division: The Individual Pieces Set (IPS) and the Radon-Nykodim Set (RNS). The algorithm can be considered as an extension of the Adjusted Winner procedure by Brams and Taylor to the three-player case, without the guarantee of envy-freeness. (original abstract)
url http://orduser.pwr.wroc.pl/DownloadFile.aspx?aid=1330
work_keys_str_mv AT marcodallaglio findingtheparetooptimalequitableallocationofhomogeneousdivisiblegoodsamongthreeplayers
AT camilladiluca findingtheparetooptimalequitableallocationofhomogeneousdivisiblegoodsamongthreeplayers
AT luciamilone findingtheparetooptimalequitableallocationofhomogeneousdivisiblegoodsamongthreeplayers
_version_ 1716765577496756224