By a cooperative game in coalitional structure or shortly coalitional game we mean the standard cooperative non-transferable utility game described by a set of payoffs for each coalition that is a nonempty subset of the grand coalition of all players. It is well-known that balancedness is a sufficient condition for the nonemptiness of the core of such a cooperative non-transferable utility game. For this result any information on the internal organization of the coalition is neglected. In this paper we generalize the concept of coalitional games and allow for organizational structure within coalitions. For a subset of players any arbitrarily given structural relation represented by a graph is allowed for. We then consider non-transferable utility games in which a possibly empty set of payoff vectors is assigned to any graph on every subset of players. Such a game will be called a cooperative game in graph structure or shortly graph game. A payoff vector lies in the core of the game if there is no graph on a group of players which can make all of its members better off. We define the balanced-core of a graph game as a refinement of the core. To do so, for each graph a power vector is determined that 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 a positive weight can be assigned such that the weighted power vectors sum up to the vector of ones. A payoff vector lies in the balanced-core if it lies in the core and the payoff vector is an element of payoff sets of all graphs in some balanced collection of graphs. We prove that any balanced graph game has a nonempty balanced-core and therefore a nonempty core. We conclude by some examples showing the usefulness of the concepts of graph games and balanced-core. In particular these examples show a close relationship between solutions to noncooperative games and balanced-core elements of a well-defined graph game. This places the paper in the Nash research program, looking for a unifying theory in which each approach helps to justify and clarify the other.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
90.
For technical questions regarding this item, or to correct its listing, contact: (Corry Stuyts).
Related research
Keywords:
Other versions of this item:
Paper
Herings,P. Jean-Jacques & Laan,Gerard,van der & Talman,Dolf, 2000.
"Cooperative Games in Graph Structure,"
Research Memoranda
011, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
[Downloadable!]
Herings,P. Jean-Jacques & Laan,Gerard,van der & Talman,Dolf, 2002.
"Cooperative Games in Graph Structure,"
Research Memoranda
011, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
[Downloadable!]
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.:
Cited by: (explanations, 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.)
Herings,P. Jean-Jacques & Laan,Gerard,van der & Talman,Dolf, 2001.
"Measuring the Power of Nodes in Digraphs,"
Research Memoranda
007, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
[Downloadable!]
Other versions: