Computing the nucleolus of some combinatorially-structured games.
From MaRDI portal
Publication:1587940
DOI10.1007/s101070000109zbMath1034.91021MaRDI QIDQ1587940
Jeroen Kuipers, Tamás Solymosi, Harry Aarts
Publication date: 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Utility theory for games (91A30)
Related Items (7)
Operations research games: A survey. (With comments and rejoinder) ⋮ On the complexity of nucleolus computation for bipartite \(b\)-matching games ⋮ A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure ⋮ Finding nucleolus of flow game ⋮ On the core of cost-revenue games: minimum cost spanning tree games with revenues ⋮ Core stability in chain-component additive games ⋮ Computing the nucleolus of weighted cooperative matching games in polynomial time
This page was built for publication: Computing the nucleolus of some combinatorially-structured games.
