We consider the division 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 characterize the optimal allocations and we develop two exact algorithms for its search. Both the characterization and the algorithm are based on the tight relationship two geometric objects of fair division: the Individual Pieces Set (IPS) and the Radon-Nykodim Set (RNS).
Dividing homogeneous divisible goods among three players / Dall'Aglio, Marco; DI LUCA, Camilla; Milone, Lucia. - Dagstuhl Report, (2016), pp. 10-25. (Dagstuhl Seminar 16232 on Fair Division. Edited by Yonatan Aumann, Jérôme Lang, and Ariel D. Procaccia., Dagstuhl, Germania, 5-10 giugno 2016). [10.4230/DagRep.6.6.10].
Dividing homogeneous divisible goods among three players
Marco Dall'Aglio
Membro del Collaboration Group
;Camilla Di LucaMembro del Collaboration Group
;Lucia MiloneMembro del Collaboration Group
2016
Abstract
We consider the division 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 characterize the optimal allocations and we develop two exact algorithms for its search. Both the characterization and the algorithm are based on the tight relationship two geometric objects of fair division: the Individual Pieces Set (IPS) and the Radon-Nykodim Set (RNS).
| File | Dimensione | Formato | |
|---|---|---|---|
|
Dagstuhl_ISSN.pdf
Open Access
Tipologia:
Documento in Post-print
Licenza:
DRM (Digital rights management) non definiti
Dimensione
1.48 MB
Formato
Adobe PDF
|
1.48 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
