Faigle, Ulrich; Kern, Walter; Paulusma, Daniël - In: Mathematical Methods of Operations Research 52 (2000) 1, pp. 23-38
Various least core concepts including the classical least core of cooperative games are discussed. By a reduction from minimum cover problems, we prove that computing an element in these least cores is in general NP-hard for minimum cost spanning tree games. As a consequence, computing the...
