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.

Finding Maxmin Allocations in Cooperative and Competitive Fair Division / Dall'Aglio, Marco; DI LUCA, Camilla. - 88/2011:(2011).

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 contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.
Fair Division; Maxmin Allocation; 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/25243
Citazioni
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact