Average tree solutions for graph games

Richard Baron, Sylvain Béal, Eric Rémila and Philippe Solal

MPRA Paper from University Library of Munich, Germany

Abstract: In this paper we consider cooperative graph games being TU-games in which players cooperate if they are connected in the communication graph. We focus our attention to the average tree solutions introduced by Herings, van der Laan and Talman [6] and Herings, van der Laan, Talman and Yang [7]. Each average tree solution is defined with re- spect to a set, say T , of admissible rooted spanning trees. Each average tree solution is characterized by efficiency, linearity and an axiom of T - hierarchy on the class of all graph games with a fixed communication graph. We also establish that the set of admissible rooted spanning trees introduced by Herings, van der Laan, Talman and Yang [7] is the largest set of rooted spanning trees such that the corresponding aver- age tree solution is a Harsanyi solution. One the other hand, we show that this set of rooted spanning trees cannot be constructed by a dis- tributed algorithm. Finally, we propose a larger set of spanning trees which coincides with the set of all rooted spanning trees in clique-free graphs and that can be computed by a distributed algorithm.

JEL-codes: C71 (search for similar items in EconPapers)
Date: 2008-07-31
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/10189/1/MPRA_paper_10189.pdf original version (application/pdf)

Related works:
Working Paper: Average tree solution for graph games (2008)
Working Paper: Average tree solutions for graph games (2008)
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:pra:mprapa:10189

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().