The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
- 1 September 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 3 (3) , 288-292
- https://doi.org/10.1137/0603029
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Minimum cost spanning tree gamesMathematical Programming, 1981
- 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
- On the core of linear production gamesMathematical Programming, 1975
- A simple expression for the nucleolus in a special caseInternational Journal of Game Theory, 1974
- Cost allocation for a spanning treeNetworks, 1973
- Cores of convex gamesInternational Journal of Game Theory, 1971
- The kernel and bargaining set for convex gamesInternational Journal of Game Theory, 1971
- On market gamesJournal of Economic Theory, 1969
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956