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 nucleolus, the nucleon and the per-capita nucleolus of minimum cost spanning tree games is also $NP$-hard.
|Place of Publication||Enschede|
|Number of pages||17|
|Publication status||Published - 1999|
|Name||Memorandum / Faculty of Mathematical Sciences|
|Publisher||Department of Applied Mathematics, University of Twente|