Values of Graph-Restricted Games
Author:
- Guillermo OwenGOGuillermo Owen
- 1 April 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 7 (2) , 210-220
Abstract
We consider the problem of modifying n-person games so as to take account of the difficulties imposed by lack of communications, and the opportunities this might accord to intermediaries. In this model, the members of a finite set are simultaneously players in a game and vertices of a graph. A combination of these two structures gives rise to a new, modified game in which the only effective coalitions are those corresponding to connected partial graphs. We study the relationship between the power indices of the original game and the restricted game; for the special case where the graph is a tree, this relationship is especially easy to analyze. Several examples are studied in detail.Keywords
This publication has 5 references indexed in Scilit:
- A game theoretic approach to measuring degree of centrality in social networksSocial Networks, 1982
- Graphs and Cooperation in GamesMathematics of Operations Research, 1977
- Multilinear extensions and the banzhaf valueNaval Research Logistics Quarterly, 1975
- Multilinear Extensions of GamesManagement Science, 1972
- 17. A Value for n-Person Games1953