We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic settings. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.
Finding maxmin allocations in cooperative and competitive fair division / Dall'Aglio, Marco; DI LUCA, Camilla. - 2011:88(2011), pp. 1-18.
Titolo: | Finding maxmin allocations in cooperative and competitive fair division | |
Autori: | ||
Data di pubblicazione: | 2011 | |
Rivista: | ||
Citazione: | Finding maxmin allocations in cooperative and competitive fair division / Dall'Aglio, Marco; DI LUCA, Camilla. - 2011:88(2011), pp. 1-18. | |
Abstract: | We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic settings. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision. | |
Handle: | http://hdl.handle.net/11385/55856 | |
Appare nelle tipologie: | 01.1 - Articolo su rivista (Article) |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
Loading suggested articles...
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.