Computing the nucleolus of min-cost spanning tree games is NP-hard.
From MaRDI portal
Publication:1972596
DOI10.1007/s001820050083zbMath1058.91511MaRDI QIDQ1972596
Walter Kern, Ulrich Faigle, Jeroen Kuipers
Publication date: 11 April 2000
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001820050083
Related Items
Finding nucleolus of flow game, On the core and nucleolus of directed acyclic graph games, Path cooperative games, Computing the least-core and nucleolus for threshold cardinality matching games, Fair cost allocations under conflicts - a game-theoretic point of view -, Computational complexity in additive hedonic games, Characterization sets for the nucleolus in balanced games, The nucleolus of arborescence games in directed acyclic graphs, NP-completeness in hedonic games, Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases, The Complexity of the Nucleolus in Compact Games, The Least-Core and Nucleolus of Path Cooperative Games, COALITION FORMATION GAMES: A SURVEY