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. The procedure 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. - Proceedings of the 1st International Workshop on Computational Social Choice (COMSOC-2006) / Ulle Endriss & Jerome Lang (eds.), (2006), pp. 111-124. (1st International Workshop on Computational Social Choice, Amsterdam, 6-8 Dicembre 2006).
How to allocate hard candies fairly
DALL'AGLIO, MARCO;
2006
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. The procedure 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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
comsoc2006.pdf
Open Access
Tipologia:
Versione dell'editore
Licenza:
DRM non definito
Dimensione
635.26 kB
Formato
Adobe PDF
|
635.26 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
