Advanced Search
MyIDEAS: Login to save this paper or follow this series

Average tree solutions for graph games

Contents:

Author Info

  • Baron, Richard
  • Béal, Sylvain
  • Remila, Eric
  • Solal, Philippe

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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://mpra.ub.uni-muenchen.de/10189/
File Function: original version
Download Restriction: no

Bibliographic Info

Paper provided by University Library of Munich, Germany in its series MPRA Paper with number 10189.

as in new window
Length:
Date of creation: 31 Jul 2008
Date of revision:
Handle: RePEc:pra:mprapa:10189

Contact details of provider:
Postal: Schackstr. 4, D-80539 Munich, Germany
Phone: +49-(0)89-2180-2219
Fax: +49-(0)89-2180-3900
Web page: http://mpra.ub.uni-muenchen.de
More information through EDIRC

Related research

Keywords:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z., 2010. "The average tree solution for cooperative games with communication structure," Games and Economic Behavior, Elsevier, Elsevier, vol. 68(2), pages 626-633, March.
  2. Talman, A.J.J. & Yamamoto, Y., 2007. "Games With Limited Communication Structure," Discussion Paper, Tilburg University, Center for Economic Research 2007-19, Tilburg University, Center for Economic Research.
  3. Gilles, R.P. & Owen, G. & Brink, J.R. van den, 1991. "Games with permission structures: The conjunctive approach," Discussion Paper, Tilburg University, Center for Economic Research 1991-14, Tilburg University, Center for Economic Research.
  4. Fabien Lange & Michel Grabisch, 2009. "Values on regular games under Kirchhoff's laws," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers), HAL halshs-00496553, HAL.
  5. Faigle, U & Kern, W, 1992. "The Shapley Value for Cooperative Games under Precedence Constraints," International Journal of Game Theory, Springer, Springer, vol. 21(3), pages 249-66.
  6. Herings, P.J.J. & Laan, G. van der & Talman, A.J.J., 2008. "The average tree solution for cycle-free graph games," Open Access publications from Tilburg University, Tilburg University urn:nbn:nl:ui:12-377604, Tilburg University.
  7. René Brink & Gerard Laan & Valeri Vasil’ev, 2007. "Component efficient solutions in line-graph games with applications," Economic Theory, Springer, Springer, vol. 33(2), pages 349-364, November.
  8. René Brink & Gerard Laan & Vitaly Pruzhansky, 2011. "Harsanyi power solutions for graph-restricted games," International Journal of Game Theory, Springer, Springer, vol. 40(1), pages 87-110, February.
  9. repec:dgr:uvatin:2008083 is not listed on IDEAS
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. repec:hal:journl:halshs-00445171 is not listed on IDEAS
  2. repec:dgr:uvatin:2008083 is not listed on IDEAS
  3. P. Jean-Jacques Herings & Gerard van der Laan & Dolf Talman & Zaifu Yang, 2008. "The Average Tree Solution for Cooperative Games with Communication Structure," Tinbergen Institute Discussion Papers, Tinbergen Institute 08-083/1, Tinbergen Institute.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:10189. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.