Computing the nucleolus of min-cost spanning tree games is NP-hard.
From MaRDI portal
Publication:1972596
DOI10.1007/s001820050083zbMath1058.91511OpenAlexW1609615991MaRDI QIDQ1972596
Jeroen Kuipers, Ulrich Faigle, Walter Kern
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 (20)
COALITION FORMATION GAMES: A SURVEY ⋮ NP-completeness in hedonic games ⋮ The Least-Core and Nucleolus of Path Cooperative Games ⋮ Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases ⋮ On the complexity of nucleolus computation for bipartite \(b\)-matching games ⋮ Computing the least-core and nucleolus for threshold cardinality matching games ⋮ Characterization sets for the nucleolus in balanced games ⋮ Arboricity games: the core and the nucleolus ⋮ Fair cost allocations under conflicts - a game-theoretic point of view - ⋮ Finding nucleolus of flow game ⋮ On the core and nucleolus of directed acyclic graph games ⋮ An algorithm to compute the nucleolus of shortest path games ⋮ The nucleolus of arborescence games in directed acyclic graphs ⋮ Path cooperative games ⋮ An efficient characterization of submodular spanning tree games ⋮ Computing the nucleolus of weighted cooperative matching games in polynomial time ⋮ Network disconnection games: a game theoretic approach to checkpoint evaluation in networks ⋮ The Complexity of the Nucleolus in Compact Games ⋮ Computational complexity in additive hedonic games ⋮ Computing the nucleolus of weighted voting games in pseudo-polynomial time
This page was built for publication: Computing the nucleolus of min-cost spanning tree games is NP-hard.
