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.

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.
Fair Division; Maxmin Allocations; Kalai Bargaining Solution; Cooperative Game Theory
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11385/55856
Citazioni
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact