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. - (2006), pp. 111-124. ((Intervento presentato al convegno 1st International Workshop on Computational Social Choice tenutosi a Amsterdam nel 6-8 Dicembre 2006.
Titolo: | How to allocate hard candies fairly | |
Autori: | ||
Data di pubblicazione: | 2006 | |
Citazione: | How to allocate hard candies fairly / Dall'Aglio, Marco; R., Mosca. - (2006), pp. 111-124. ((Intervento presentato al convegno 1st International Workshop on Computational Social Choice tenutosi a Amsterdam nel 6-8 Dicembre 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. | |
Handle: | http://hdl.handle.net/11385/5405 | |
Appare nelle tipologie: | 04.1 - Contributo in Atti di convegno (Paper in Proceedings) |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
comsoc2006.pdf | Versione dell'editore | DRM non definito | Open Access Visualizza/Apri |