Note Computing the nucleolus of min-cost spanning tree games is NP-hard

Abstract. We prove that computing the nucleolus of minimum cost spanning tree games is in general NP-hard. The proof uses a reduction from minimum cover problems.

[1]  Jeroen Kuipers,et al.  Computing the nucleolus of some combinatorially-structured games , 2000, Math. Program..

[2]  Daniel Granot,et al.  Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem , 1992, Math. Oper. Res..

[3]  Sándor P. Fekete,et al.  The nucleon of cooperative games and an algorithm for matching games , 1998, Math. Program..

[4]  C. G. Bird,et al.  On cost allocation for a spanning tree: A game theoretic approach , 1976, Networks.

[5]  G. Owen,et al.  The kernel/nucleolus of a standard tree game , 1996 .

[6]  Nimrod Megiddo,et al.  Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree , 1978, Math. Oper. Res..

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Daniel Granot,et al.  Minimum cost spanning tree games , 1981, Math. Program..

[9]  L. S. Shapley,et al.  Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts , 1979, Math. Oper. Res..

[10]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[11]  Sándor P. Fekete,et al.  On the complexity of testing membership in the core of min-cost spanning tree games , 1997, Int. J. Game Theory.

[12]  D. Schmeidler.  The Nucleolus of a Characteristic Function Game , 1969 .

[13]  Daniel Granot,et al.  On the core and nucleolus of minimum cost spanning tree games , 1984, Math. Program..