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! ]

A Characterization of the Average Tree Solution for Cycle-Free Graph Games

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Mishra, D.
Talman, A.J.J. (Tilburg University, Center for Economic Research)

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

Abstract

Herings et al. (2008) proposed a solution concept called the average tree solution for cycle-free graph games. We provide a characterization of the average tree solution for cycle-free graph games. The characteration underlines an important difference, in terms of symmetric treatment of agents, between the average tree solution and the Myerson value (Myerson, 1977) for cycle-free graph games.

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://arno.uvt.nl/show.cgi?fid=94210
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2009-17.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 2009
Date of revision:
Handle: RePEc:dgr:kubcen:200917

Contact details of provider:
Web page: http://center.uvt.nl

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

Related research
Keywords:

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. Mamoru Kaneko & Myrna Holtz Wooders, 1982. "Cores of Partitioning Games," Cowles Foundation Discussion Papers 620, Cowles Foundation, Yale University. [Downloadable!]
    Other versions:
  2. Demange, Gabrielle, 1994. "Intermediate preferences and stable coalition structures," Journal of Mathematical Economics, Elsevier, vol. 23(1), pages 45-58, January. [Downloadable!] (restricted)
    Other versions:
  3. Le Breton, M & Owen, G & Weber, S, 1992. "Strongly Balanced Cooperative Games," International Journal of Game Theory, Springer, vol. 20(4), pages 419-27.
    Other versions:
  4. 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)
Full references

Statistics
Access and download statistics

Did you know? About 1000 journals are listed on RePEc.

This page was last updated on 2009-11-25.

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.