We consider the problem of allocating a finite number of indivisible items to two players with additive utilities. We design a procedure that looks for all the maximin allocations and makes repeated use of an extension of the Adjusted Winner, an effective procedure that deals with divisible items, to find new candidate solutions, and to suggest which items should be assigned to the players.

How to allocate hard candies fairly / Dall'Aglio, Marco; R., Mosca. - In: MATHEMATICAL SOCIAL SCIENCES. - ISSN 0165-4896. - 54:(2007), pp. 218-237. [10.1016/j.mathsocsci.2007.04.008]

How to allocate hard candies fairly

DALL'AGLIO, MARCO;
2007

Abstract

We consider the problem of allocating a finite number of indivisible items to two players with additive utilities. We design a procedure that looks for all the maximin allocations and makes repeated use of an extension of the Adjusted Winner, an effective procedure that deals with divisible items, to find new candidate solutions, and to suggest which items should be assigned to the players.
How to allocate hard candies fairly / Dall'Aglio, Marco; R., Mosca. - In: MATHEMATICAL SOCIAL SCIENCES. - ISSN 0165-4896. - 54:(2007), pp. 218-237. [10.1016/j.mathsocsci.2007.04.008]
File in questo prodotto:
File Dimensione Formato  
1 - HardCandies.pdf

Solo gestori archivio

Tipologia: Documento in Post-print
Licenza: DRM non definito
Dimensione 612.36 kB
Formato Adobe PDF
612.36 kB Adobe PDF   Visualizza/Apri
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11385/3016
Citazioni
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 4
social impact