Characterization of the Average Tree solution and its kernel - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2014

Characterization of the Average Tree solution and its kernel

Résumé

In this article, we study cooperative games with limited cooperation possibilities, represented by a tree on the set of agents. Agents in the game can cooperate if they are connected in the tree. We first derive direct-sum decompositions of the space of TU-games on a fixed tree, and two new basis for these spaces of TU-games. We then focus our attention on the Average (rooted)-Tree solution (see Herings, P., van der Laan, G., Talman, D., 2008. The Average Tree Solution for Cycle-free Games. Games and Economic Behavior 62, 77-92). We provide a basis for its kernel and a new axiomatic characterization by using the classical axiom for inessential games, and two new axioms of invariance, namely Invariance with respect to irrelevant coalitions and Weighted addition invariance on bi-partitions.
Fichier principal
Vignette du fichier
WP-2014-04.pdf (419.15 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01377928 , version 1 (07-10-2016)

Identifiants

  • HAL Id : hal-01377928 , version 1

Citer

Sylvain Béal, Eric Rémila, Philippe Solal. Characterization of the Average Tree solution and its kernel. 2014. ⟨hal-01377928⟩
102 Consultations
72 Téléchargements

Partager

Gmail Facebook X LinkedIn More