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

D. Mishra, A.J.J. Talman

Research output: Working paperDiscussion paperOther research output

239 Downloads (Pure)

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.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages14
Volume2009-17
Publication statusPublished - 2009

Publication series

NameCentER Discussion Paper
Volume2009-17

Keywords

  • average tree solution
  • graph games
  • Myerson value
  • Shapley value

Fingerprint Dive into the research topics of 'A Characterization of the Average Tree Solution for Cycle-Free Graph Games'. Together they form a unique fingerprint.

Cite this