Coalition structures induced by the strength of a graph
AbstractWe study cooperative games associated with a communication structure which takes into account a level of communication between players. Let us consider an undirected communication graph : each node represents a player and there is an edge between two nodes if the corresponding players can communicate directly. Moreover we suppose that a weight is associated with each edge. We compute the so-called strength of this graph and use the corresponding partition to determine a particular coalition structure. The strength of a graph is a measure introduced in graph theory to evaluate the resistance of networks under attacks. It corresponds to the minimum on all subsets of edges of the ratio between the sum of the weights of the edges and the number of connected components created when the set of edges is suppressed from the graph. The set of edges corresponding to the minimum ratio induces a partition of the graph. We can iterate the calculation of the strength on the subgraphs of the partition to obtain refined partitions which we use to define a hierarchy of coalition structures. For a given game on the graph, we build new games induced by these coalition structures and study the inheritance of convexity properties, and the Shapley value associated with them.
Download InfoIf 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.
Bibliographic InfoPaper provided by HAL in its series Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) with number halshs-00639685.
Date of creation: Jul 2011
Date of revision:
Note: View the original document on HAL open archive server: http://halshs.archives-ouvertes.fr/halshs-00639685
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/
Communication networks; coalition structure; cooperative game.;
Other versions of this item:
- Michel Grabisch & Alexandre Skoda, 2011. "Coalition structures induced by the strength of a graph," Documents de travail du Centre d'Economie de la Sorbonne 11059, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-11-21 (All new papers)
- NEP-GTH-2011-11-21 (Game Theory)
- NEP-NET-2011-11-21 (Network Economics)
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.:
- Nouweland, C.G.A.M. van den & Borm, P.E.M., 1991.
"On the convexity of communication games,"
Open Access publications from Tilburg University
urn:nbn:nl:ui:12-146634, Tilburg University.
- Michel Grabisch, 2009.
"The core of games on ordered structures and graphs,"
UniversitÃ© Paris1 PanthÃ©on-Sorbonne (Post-Print and Working Papers)
- Michel Grabisch, 2013. "The core of games on ordered structures and graphs," UniversitÃ© Paris1 PanthÃ©on-Sorbonne (Post-Print and Working Papers) hal-00803233, HAL.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD).
If references are entirely missing, you can add them using this form.