We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.
Titolo: | Finding Maxmin Allocations in Cooperative and Competitive Fair Division |
Autori: | |
Data di pubblicazione: | 2011 |
Abstract: | We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision. |
Handle: | http://hdl.handle.net/11385/25243 |
Appare nelle tipologie: | 05.1 - Working Paper |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.