Characterization sets for the nucleolus

DOI10.1007/s001820050078zbMath0960.91009OpenAlexW2066311617MaRDI QIDQ1972591

Frieda Granot, Daniel Granot, Weiping R. Zhu

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/s001820050078

zbMATH Keywords

nucleolusstrongly polynomial algorithmminimum cost spanning tree gamesoooperative game

Mathematics Subject Classification ID

Cooperative games (91A12) Complexity and performance of numerical algorithms (65Y20)

Related Items

On the complexity of nucleolus computation for bipartite \(b\)-matching games ⋮ Characterization sets for the nucleolus in balanced games ⋮ Finding and verifying the nucleolus of cooperative games ⋮ 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 ⋮ Computing the nucleolus of weighted cooperative matching games in polynomial time ⋮ The Complexity of the Nucleolus in Compact Games ⋮ A heuristic procedure for computing the nucleolus

This page was built for publication: Characterization sets for the nucleolus