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.
Titolo: | How to allocate hard candies fairly |
Autori: | |
Data di pubblicazione: | 2007 |
Rivista: | |
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. |
Handle: | http://hdl.handle.net/11385/3016 |
Appare nelle tipologie: | 01.1 - Articolo su rivista (Article) |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
1 - HardCandies.pdf | Documento in Post-print | DRM non definito | Administrator |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.