On the complexity of testing membership in the core of min-cost spanning tree games

International Journal of Game Theory

Volumn 26, Issue 3, 1997, Pages 361-366

  Faigle, Ulrich ^a   Kern, Walter ^a   Fekete, Sándor P ^b   Hochstättler, Winfried ^b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITY OF COLOGNE   (Germany)

Author keywords

Cooperative game; Core; NP complete; Spanning tree; X3C

Indexed keywords

EID: 0031520081     PISSN: 00207276     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01263277     Document Type: Article

References (16)

1. Aarts H [1994] Minimum cost spanning tree games and set games. Ph.D. Thesis, University of Twente, Endschede
2. Aarts H, Driessen TSH [1993] The irreducible core of a minimum cost spanning tree game. Zeitschrift für Operations Research 38: 163-174
3. Bird C [1976] On cost allocation for a spanning tree: A game theoretic approach. Networks 6: 335-350
4. Chvátal V [1978] Rational behavior and computational complexity. Technical Report SOCS-78.9, School of Computer Science, McGill University, Montreal
5. Claus A, Kleitman DJ [1973] Cost allocation for a spanning tree. Networks 3: 289-304
6. Deng X, Papadimitriou CH [1994] On the complexity of cooperative solution concepts. Mathematics of Operations Research 19: 257-266
7. Edmonds J [1970] Submodular functions, matroids, and certain polyhedra. In: Guy R. et al. (eds.) Combinatorial structures and their applications. Gordon and Breach, New York: 69-87
8. Garey MR, Johnson DS [1979] Computers and intractability. A guide to the theory of NP-completeness. Freeman, New York
9. Grötschel M, Lovász L, Schrijver A [1988] Geometric algorithms and combinatorial optimization. Springer-Verlag, Berlin
10. Granot D, Granot F [1993] Computational complexity of a cost allocation approach to a fixed cost spanning forest problem. Mathematics of Operations Research 17: 765-780
11. Granot D, Huberman G [1981] Minimum cost spanning tree games, mathematical Programming 21: 1-18
12. Granot D, Huberman G [1982] The relationship between convex games and minimum cost spanning tree games: A case for permutationally convex games. SIAM Journ. Algebraic and Discrete Methods 3: 288-292
13. Kuipers J [1994] Combinatorial methods in cooperative game theory. Ph.D. Thesis, University of Limburg, Maastricht
14. Meggido N [1978] Computational complexity of the game theory approach to cost allocation for a tree. Mathematics of Operations Research 3: 189-196
15. Shapley LS [1971] Cores and convex games. International Journal of Game Theory 1: 1-26
16. Tamir A [1991] On the core of network synthesis games. Mathematical Programming 50: 123-135