Communication and its cost in graph-restricted games
- 1 November 1988
- journal article
- Published by Springer Nature in Theory and Decision
- Vol. 25 (3), 275-286
- https://doi.org/10.1007/bf00133166
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Totally balanced games arising from controlled programming problemsMathematical Programming, 1984
- Generalized Network Problems Yielding Totally Balanced GamesOperations Research, 1982
- A game theoretic approach to measuring degree of centrality in social networksSocial Networks, 1982
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex GamesSIAM Journal on Algebraic Discrete Methods, 1982
- Totally Balanced Games and Games of FlowMathematics of Operations Research, 1982
- Minimum cost spanning tree gamesMathematical Programming, 1981
- Computational Complexity of the Game Theory Approach to Cost Allocation for a TreeMathematics of Operations Research, 1978
- Graphs and Cooperation in GamesMathematics of Operations Research, 1977
- On cost allocation for a spanning tree: A game theoretic approachNetworks, 1976
- Cost allocation for a spanning treeNetworks, 1973