This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Average tree solutions for graph games

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Baron, Richard
Béal, Sylvain
Remila, Eric
Solal, Philippe

Additional information is available for the following registered author(s):

Abstract

In this paper we consider cooperative graph games being TU-games in which players cooperate if they are connected in the communication graph. We focus our attention to the average tree solutions introduced by Herings, van der Laan and Talman [6] and Herings, van der Laan, Talman and Yang [7]. Each average tree solution is defined with re- spect to a set, say T , of admissible rooted spanning trees. Each average tree solution is characterized by efficiency, linearity and an axiom of T - hierarchy on the class of all graph games with a fixed communication graph. We also establish that the set of admissible rooted spanning trees introduced by Herings, van der Laan, Talman and Yang [7] is the largest set of rooted spanning trees such that the corresponding aver- age tree solution is a Harsanyi solution. One the other hand, we show that this set of rooted spanning trees cannot be constructed by a dis- tributed algorithm. Finally, we propose a larger set of spanning trees which coincides with the set of all rooted spanning trees in clique-free graphs and that can be computed by a distributed algorithm.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

File URL: http://mpra.ub.uni-muenchen.de/10189/
File Format:
File Function:
Download Restriction: no

Publisher Info
Paper provided by University Library of Munich, Germany in its series MPRA Paper with number 10189.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 31 Jul 2008
Date of revision:
Handle: RePEc:pra:mprapa:10189

Contact details of provider:
Postal: Schackstr. 4, D-80539 Munich, Germany
Phone: +49-(0)89-2180-2219
Fax: +49-(0)89-2180-3900
Web page: http://mpra.ub.uni-muenchen.de
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Ekkehart Schlicht).

Related research
Keywords:

Other versions of this item:

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:

References listed on IDEAS
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.:
  1. Herings, P.J.J. & Laan, G. van der & Talman, A.J.J. & Yang, Z.F., 2008. "The Average Tree Solution for Cooperative Games with Communication Structure," Discussion Paper 2008-73, Tilburg University, Center for Economic Research. [Downloadable!]
    Other versions:
  2. Talman, A.J.J. & Yamamoto, Y., 2007. "Games With Limited Communication Structure," Discussion Paper 2007-19, Tilburg University, Center for Economic Research. [Downloadable!]
  3. Herings, P. Jean Jacques & van der Laan, Gerard & Talman, Dolf, 2008. "The average tree solution for cycle-free graph games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 77-92, January. [Downloadable!] (restricted)
  4. Gilles, Robert P & Owen, Guillermo & van den Brink, Rene, 1992. "Games with Permission Structures: The Conjunctive Approach," International Journal of Game Theory, Springer, vol. 20(3), pages 277-93.
  5. Fabien Lange & Michel Grabisch, 2006. "Values on regular games under Kirchhoff’s laws," Working Paper Series 0807, Budapest Tech, Keleti Faculty of Economics, revised Nov 2008. [Downloadable!]
    Other versions:
  6. René van den Brink & Gerard van der Laan & Vitaly Pruzhansky, 2004. "Harsanyi Power Solutions for Graph-restricted Games," Tinbergen Institute Discussion Papers 04-095/1, Tinbergen Institute. [Downloadable!]
  7. René Brink & Gerard Laan & Valeri Vasil’ev, 2007. "Component efficient solutions in line-graph games with applications," Economic Theory, Springer, vol. 33(2), pages 349-364, November. [Downloadable!] (restricted)
  8. Faigle, U & Kern, W, 1992. "The Shapley Value for Cooperative Games under Precedence Constraints," International Journal of Game Theory, Springer, vol. 21(3), pages 249-66.
Full references

Cited by:
(explanations, 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.)

  1. Herings, P.J.J. & Laan, G. van der & Talman, A.J.J. & Yang, Z.F., 2008. "The Average Tree Solution for Cooperative Games with Communication Structure," Discussion Paper 2008-73, Tilburg University, Center for Economic Research. [Downloadable!]
    Other versions:
Statistics
Access and download statistics

Did you know? All top Economics journals are listed on RePEc.

This page was last updated on 2009-12-8.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.