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

D. Mishra and Dolf Talman ()

No 2009-17, Discussion Paper from Tilburg University, Center for Economic Research

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.

JEL-codes: C71 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-gth
Date: 2009
View list of references

Downloads: (external link)
http://arno.uvt.nl/show.cgi?fid=94210 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:dgr:kubcen:200917

Access Statistics for this paper

More papers in Discussion Paper from Tilburg University, Center for Economic Research
Series data maintained by Corry Stuyts ().