On the core and nucleolus of minimum cost spanning tree games
- 1 July 1984
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 29 (3) , 323-347
- https://doi.org/10.1007/bf02592000
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex GamesSIAM Journal on Algebraic Discrete Methods, 1982
- Minimum cost spanning tree gamesMathematical Programming, 1981
- Geometric Properties of the Kernel, Nucleolus, and Related Solution ConceptsMathematics of Operations Research, 1979
- Internal Telephone Billing Rates—A Novel Application of Non-Atomic Game TheoryOperations Research, 1978
- Computational Complexity of the Game Theory Approach to Cost Allocation for a TreeMathematics of Operations Research, 1978
- On cost allocation for a spanning tree: A game theoretic approachNetworks, 1976
- A simple expression for the nucleolus in a special caseInternational Journal of Game Theory, 1974
- A Simple Expression for the Shapley Value in a Special CaseManagement Science, 1973
- Cost allocation for a spanning treeNetworks, 1973
- The kernel of a cooperative gameNaval Research Logistics Quarterly, 1965