Minimum cost spanning tree games
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
We consider the problem of cost allocation among users of a minimum cost spanning tree network. It is formulated as a cooperative game in characteristic function form, referred to as a minimum cost spanning tree (m.c.s.t.) game. We show that the core of a m.c.s.t. game is never empty. In fact, a point in the core can be read directly from any minimum cost spanning tree graph associated with the problem. For m.c.s.t. games with efficient coalition structures we define and construct m.c.s.t. games on the components of the structure. We show that the core and the nucleolus of the original game are the cartesian products of the cores and the nucleoli, respectively, of the induced games on the components of the efficient coalition structure.
- C.G. Bird, “On cost allocation for a spanning tree: A game theory approach”,Networks 6 (1976) 335–350.
- A. Claus and D.J. Kleitman, “Cost-allocation for a spanning tree”,Networks 3 (1973) 289–304.
- A. Claus and D. Granot, “Game theory application to cost allocation for a spanning tree”, Working Paper No. 402, Faculty of Commerce and Business Administration, University of British Columbia (June 1976).
- D. Granot and G. Huberman, “Minimum cost spanning tree games”, Working Paper No. 403, Faculty of Commerce, U.B.C. (June 1976; revised Sept. 1976/August 1977).
- D. Granot and G. Huberman, “Permutationally convex games and minimum spanning tree games”, Discussion Paper 77-10-3, Simon Fraser University (June 1977).
- A. Kopelowitz, “Computation of the kernels of simple games and the nucleolus ofn-person games”, Research Memorandum No. 31, Department of Mathematics, The Hebrew University of Jerusalem (September 1967).
- S.C. Littlechild, “A simple expression for the nucleolus in a special case”,International Journal of Game Theory 3 (1974) 21–29.
- N. Megiddo, “Computational complexity and the game theory approach to cost allocation for a tree”,Mathematics of Operations Research 3 (1978) 189–196.
- N. Megiddo, “Cost allocation for Steiner trees”,Networks 8 (1978) 1–6.
- L.S. Shapley, “A value forn-person games”,Annals of Mathematics Study 28 (1953) 307–317.
- Minimum cost spanning tree games
Volume 21, Issue 1 , pp 1-18
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Game Theory
- Cost Allocation
- Spanning Tree
- Industry Sectors