We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. These bounds are based on the convexity properties of the range of utility vectors associated to all possible divisions of the good. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.

Computing Values for Games of CooperativeFair Division / Dall'Aglio, Marco; DI LUCA, Camilla. - (2012), pp. 306-325.

Computing Values for Games of CooperativeFair Division

DALL'AGLIO, MARCO;DI LUCA, CAMILLA
2012

Abstract

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. These bounds are based on the convexity properties of the range of utility vectors associated to all possible divisions of the good. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.
9788846730459
Fair Division; Cooperative Game Theory; Convex Optimization; Subgradient Algorithm
Computing Values for Games of CooperativeFair Division / Dall'Aglio, Marco; DI LUCA, Camilla. - (2012), pp. 306-325.
File in questo prodotto:
File Dimensione Formato  
ComputingValuesASMDA2011.pdf

Solo gestori archivio

Descrizione: Copia personale dell'articolo pubblicato
Tipologia: Documento in Post-print
Licenza: DRM non definito
Dimensione 284.69 kB
Formato Adobe PDF
284.69 kB Adobe PDF   Visualizza/Apri
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: https://hdl.handle.net/11385/49655
Citazioni
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact