Pré-Publication, Document De Travail Année : 2015

Efficient extensions of communication values

Résumé

We study values for transferable utility games enriched by a communication graph. The most well-known such values are component-efficient and characterized by some link-deletion property. We study efficient extensions of such values: for a given component-efficient value, we look for a value that (i) satisfies efficiency, (ii) satisfies the link-deletion property underlying the original component-efficient value, and (iii) coincides with the original component-efficient value whenever the underlying graph is connected. Béal et al. (2015) prove that the Myerson value (Myerson, 1977) admits a unique efficient extension, which has been introduced by van den Brink et al. (2012). We pursue this line of research by showing that the average tree solution (Herings et al., 2008) and the compensation solution (Béal et al., 2012a) admit similar unique efficient extensions, and that there exists no efficient extension of the position Value (Meessen, 1988; Borm et al., 1992). As byproducts, we obtain new characterizations of the average tree solution and the compensation solution, and of their efficient extensions.

Fichier principal
Vignette du fichier
WP-2015-04.pdf (476.99 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Licence
Loading...

Dates et versions

hal-01376907 , version 1 (05-10-2016)

Licence

Identifiants

  • HAL Id : hal-01376907 , version 1

Citer

Sylvain Béal, André Casajus, Frank Huettner. Efficient extensions of communication values. 2015. ⟨hal-01376907⟩

Collections

210 Consultations
320 Téléchargements

Partager

  • More