Abstract.
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Manuscript received: March 1999/Final version received: February 2000
Rights and permissions
About this article
Cite this article
Faigle, U., Kern, W. & Paulusma, D. Note on the computational complexity of least core concepts for min-cost spanning tree games. Mathematical Methods of OR 52, 23–38 (2000). https://doi.org/10.1007/s001860000059
Issue Date:
DOI: https://doi.org/10.1007/s001860000059