A Characterization of the average tree solution for tree games

Debasis Mishra and Adolphus Talman

Discussion Papers from Indian Statistical Institute, Delhi

Abstract: For the class of tree games, a new solution called the average tree solution has been proposed recently. We provide a characterization of this solution. This characterization underlines an important difference, in terms of symmetric treatment of the agents, between the average tree solution and the Myerson value for the class of tree games.

Keywords: tree; graph games; Myerson value; Shapley value (search for similar items in EconPapers)
JEL-codes: C71 (search for similar items in EconPapers)
Pages: 8 pages
Date: 2009-12
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.isid.ac.in/~pu/dispapers/dp09-08.pdf (application/pdf)

Related works:
Journal Article: A characterization of the average tree solution for tree games (2010)
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: https://EconPapers.repec.org/RePEc:alo:isipdp:09-08

Access Statistics for this paper

More papers in Discussion Papers from Indian Statistical Institute, Delhi Contact information at EDIRC.
Bibliographic data for series maintained by Debasis Mishra ().