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

Cooperative Games in Graph Structure


Author Info

  • P. Jean-Jacques Herings

    (University of Maastricht)

  • Gerard van der Laan

    (Vrije Universiteit Amsterdam)

  • Dolf Talman

    (Tilburg University)


In this paper we generalize the concept of coalitional games by allowingfor any organizational structure within coalitions represented by a graphon the set of players ot the coalition. A, possibly empty, set of payoffvectors is assigned to any graph on every subset of players. Such a gamewill be called a graph game. For each graph a power vector is determinedthat depends on the relative positions of the players within the graph.A collection of graphs will be called balanced if to any graph in the collection apositive weight can be assigned such that the weighted power vectorssum up to the vector of ones. We then define the balanced-core as a refinement ofthe core. A payoff vector lies in the balanced-core if it lies in the core andthe payoff vector is an element of payoff sets of all graphs in some balanced collection ofgraphs. We prove that any balanced graph game has a nonempty balanced-core.We conclude by some examples showing the usefulness of the conceptsof graph games and balanced-core. In particular these examples show a closerelationship between solutions to noncooperative games andbalanced-core elements of a well-defined graph game.

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:
Download Restriction: no

Bibliographic Info

Paper provided by Tinbergen Institute in its series Tinbergen Institute Discussion Papers with number 00-072/1.

as in new window
Date of creation: 25 Aug 2000
Date of revision:
Handle: RePEc:dgr:uvatin:20000072

Contact details of provider:
Web page:

Related research

Keywords: cooperative games; graphs; balancedness; core; Nash program;

Other versions of this item:


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. Nowak Andrzej S. & Radzik Tadeusz, 1994. "The Shapley Value for n-Person Games in Generalized Characteristic Function Form," Games and Economic Behavior, Elsevier, vol. 6(1), pages 150-161, January.
  2. Bouyssou, Denis, 1992. "Ranking methods based on valued preference relations: A characterization of the net flow method," European Journal of Operational Research, Elsevier, vol. 60(1), pages 61-67, July.
  3. Laan, G. van der & Talman, A.J.J. & Yang, Z.F., 1999. "Intersection theorems on polytypes," Open Access publications from Tilburg University urn:nbn:nl:ui:12-78480, Tilburg University.
  4. Laan, G. van der & Talman, A.J.J. & Yang, Z.F., 1998. "Cooperative games in permutational structure," Open Access publications from Tilburg University urn:nbn:nl:ui:12-76584, Tilburg University.
  5. Ichiishi, Tatsuro & Idzik, Adam, 1991. "Closed Covers of Compact Convex Polyhedra," International Journal of Game Theory, Springer, vol. 20(2), pages 161-69.
  6. P. Jean-Jacques Herings, 1997. "An extremely simple proof of the K-K-M-S Theorem," Economic Theory, Springer, vol. 10(2), pages 361-367.
  7. Nash, John, 1953. "Two-Person Cooperative Games," Econometrica, Econometric Society, vol. 21(1), pages 128-140, April.
  8. Doup, T.M. & Talman, A.J.J., 1987. "A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices," Open Access publications from Tilburg University urn:nbn:nl:ui:12-148734, Tilburg University.
  9. Jean Tirole, 1988. "The Theory of Industrial Organization," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262200716, December.
Full references (including those not matched with items on IDEAS)


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

Cited by:
  1. Michel Grabisch & Agnieszka Rusinowska, 2008. "A model of influence in a social network," Documents de travail du Centre d'Economie de la Sorbonne b08066, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
  2. van den Brink, Rene & van der Laan, Gerard, 2005. "A class of consistent share functions for games in coalition structure," Games and Economic Behavior, Elsevier, vol. 51(1), pages 193-212, April.
  3. P. Jean-Jacques Herings & Gerard van der Laan & Dolf Talman, 2001. "Measuring the Power of Nodes in Digraphs," Tinbergen Institute Discussion Papers 01-096/1, Tinbergen Institute.
  4. Ruys, P.H.M., 2002. "A Managed Service Economy With an Equilibrium for Marketable Services," Discussion Paper 2002-1, Tilburg University, Center for Economic Research.


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


Access and download statistics


When requesting a correction, please mention this item's handle: RePEc:dgr:uvatin:20000072. 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: (Antoine Maartens (+31 626 - 160 892)).

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.