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

Debasis Mishra, Dolf J. J. Talman
2009 Social Science Research Network  
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 Classification: C71
doi:10.2139/ssrn.1365143 fatcat:3gsc6tryordfrp6s55ul4w7dbi