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.
Dall'Aglio, Marco; DI LUCA, Camilla. (2011). Finding maxmin allocations in cooperative and competitive fair division. NOTE DI LAVORO DELLA FONDAZIONE ENI ENRICO MATTEI no. 2011. http://www.feem.it/userfiles/attach/20111221122584NDL2011-088.pdf
Finding maxmin allocations in cooperative and competitive fair division
DALL'AGLIO, MARCO;DI LUCA, CAMILLA
2011
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
