Note on the computational complexity of least core concepts for min-cost spanning tree games (2000)
Journal Article
Faigle, U., Kern, W., & Paulusma, D. (2000). Note on the computational complexity of least core concepts for min-cost spanning tree games. Mathematical Methods of Operations Research, 52(1), 23-38. https://doi.org/10.1007/s001860000059

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 tre... Read More about Note on the computational complexity of least core concepts for min-cost spanning tree games.