The Average Tree Solution for Multi-choice Forest Games - HAL-SHS - Sciences de l'Homme et de la Société Accéder directement au contenu
Article Dans Une Revue Annals of Operations Research Année : 2012

The Average Tree Solution for Multi-choice Forest Games

Résumé

In this article we study cooperative multi-choice games with limited cooperation possibilities, represented by an undirected forest on the player set. Players in the game can cooperate if they are connected in the forest. We introduce a new (single-valued) solution concept which is a generalization of the average tree solution defined and characterized by Herings et al. (Games Econ. Behav. 62:77-92, 2008) for TU-games played on a forest. Our solution is characterized by component efficiency, component fairness and independence on the greatest activity level. It belongs to the precore of a restricted multi-choice game whenever the underlying multi-choice game is superadditive and isotone. We also link our solution with the hierarchical outcomes (Demange in J. Polit. Econ. 112:754-778, 2004) of some particular TU-games played on trees. Finally, we propose two possible economic applications of our average tree solution.

Dates et versions

halshs-00690676 , version 1 (24-04-2012)

Identifiants

Citer

Sylvain Béal, Aymeric Lardon, Éric Rémila, Philippe Solal. The Average Tree Solution for Multi-choice Forest Games. Annals of Operations Research, 2012, 196 (1), pp.27-51. ⟨10.1007/s10479-012-1150-1⟩. ⟨halshs-00690676⟩
124 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More