A connectivity game for graphs (Q2386339)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A connectivity game for graphs |
scientific article; zbMATH DE number 2197187
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A connectivity game for graphs |
scientific article; zbMATH DE number 2197187 |
Statements
A connectivity game for graphs (English)
0 references
22 August 2005
0 references
The referred paper deals with the model of connectivity game on graphs as a special modification of coalitional games, where coalition means a connected set of vertices and edges. The main idea of the paper is, to study the importance of a vertex as a degree in which it contributes to the set of connections in the graph. Members of the wide family of solutions are used as allocation rules which allow to weight the marginal contributions of particular vertices. These solutions are the semivalues whose properties characterize the role of different vertices in the connectivity of the graph and the size of coalitions decisive for that connectivity.
0 references
game
0 references
cooperative game
0 references
graph
0 references
vertex
0 references
weighted connectivity
0 references
coalition
0 references
semivalue
0 references
0 references
0 references
0.9144789
0 references
0 references
0.89606357
0 references
0.89606357
0 references
