Note on the computational complexity of least core concepts for min-cost spanning tree games.

DOI10.1007/s001860000059zbMath1054.91010OpenAlexW2165116885MaRDI QIDQ1403160

Walter Kern, Ulrich Faigle, Daniël Paulusma

Publication date: 2000

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/6122/1/6122.pdf

zbMATH Keywords

cooperative gamesNP-hardnucleolusleast core

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Cooperative games (91A12)

Related Items

On the complexity of nucleolus computation for bipartite \(b\)-matching games, Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation, Approximating the least core value and least core of cooperative games with supermodular costs, The least square B-nucleolus for fuzzy cooperative games, Algorithmic Cost Allocation Games: Theory and Applications, Computing the nucleolus of weighted cooperative matching games in polynomial time, Fair ticket pricing in public transport as a constrained cost allocation game