Comparable Axiomatizations of the Myerson Value, the Restricted Banzhaf Value, Hierarchical Outcomes and the Average Tree Solution for Cycle-Free Graph Restricted Games
AbstractWe consider cooperative transferable utility games, or simply TU-games, with a limited communication structure in which players can cooperate if and only if they are connected in the communication graph. A difference between the restricted Banzhaf value and the Myerson value (i.e. the Shapley value of the restricted game) is that the restricted Banzhaf value satisfies collusion neutrality, while the Myerson value satisfies component efficiency. Requiring both efficiency and collusion neutrality for cycle-free graph games yields other solutions such as the hierarchical outcomes and the average tree solution. Since these solutions also satisfy the superfluous player property, this also `solves' an impossibility for TU-games since there is no solution for these games that satisfies efficiency, collusion neutrality and the null player property. We give axiomatizations of the restricted Banzhaf value, the hierarchical outcomes and the average tree solution that are comparable with axiomatizations of the Myerson value in case the communication graph is cycle-free. Finally, we generalize these solutions to classes of solutions for cycle-free graph games using network power measures.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tinbergen Institute in its series Tinbergen Institute Discussion Papers with number 09-108/1.
Date of creation: 25 Nov 2009
Date of revision:
Contact details of provider:
Web page: http://www.tinbergen.nl
Cooperative TU-game; communication structure; Myerson value; Shapley value; Banzhaf value; hierarchical outcome; average tree solution; component efficiency; collusion neutrality.;
Find related papers by JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-05-15 (All new papers)
- NEP-CDM-2010-05-15 (Collective Decision-Making)
- NEP-GTH-2010-05-15 (Game Theory)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Le Breton, M & Owen, G & Weber, S, 1992.
"Strongly Balanced Cooperative Games,"
International Journal of Game Theory,
Springer, vol. 20(4), pages 419-27.
- Le Breton,Michel & Owen,Guillermo & Weber,Shlomo, 1991. "Strongly balanced cooperative games," Discussion Paper Serie A 338, University of Bonn, Germany.
- Le Breton, M. & Owen, G. & Weber, S., 1991. "Strongly Balanced Cooperative Games," G.R.E.Q.A.M. 91a09, Universite Aix-Marseille III.
- Le Breton, M. & Owen, G. & Weber, S., 1991. "Strongly Balanced Cooperative Games," Papers 92-3, York (Canada) - Department of Economics.
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "The sequential equal surplus division for sharing a river," MPRA Paper 37346, University Library of Munich, Germany.
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2009.
"Average tree solutions and the distribution of Harsanyi dividends,"
17909, University Library of Munich, Germany.
- Richard Baron & Sylvain Béal & Eric Rémila & Philippe Solal, 2011. "Average tree solutions and the distribution of Harsanyi dividends," International Journal of Game Theory, Springer, vol. 40(2), pages 331-349, May.
- Béal, Sylvain & Lardon, Aymeric & Rémila, Eric & Solal, Philippe, 2011. "The Average Tree Solution for Multi-choice Forest Games," MPRA Paper 28739, University Library of Munich, Germany.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Antoine Maartens (+31 626 - 160 892)).
If references are entirely missing, you can add them using this form.