Computing the nucleolus of some combinatorially-structured games.

DOI10.1007/S101070000109MaRDI QIDQ1587940zbMATH OpenFDO

Authors J. Kuipers, Tamás Solymosi, Harry Aarts

Publication date 2000

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S101070000109

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Utility theory for games (91A30)

Recommendations

• Computing the nucleolus of cyclic permutation games
• On the computation of the nucleolus of a cooperative game
• On computing the nucleolus of a balanced connected game
• A procedure to compute the nucleolus of the assignment game
• The complexity of the nucleolus in compact games
• scientific article; zbMATH DE number 1187071
• An algorithm for finding the nucleolus of assignment games
• A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure
• On the complexity of nucleolus computation for bipartite \(b\)-matching games
• scientific article; zbMATH DE number 4152185

Cited in

(20)

• Computation of the nucleolus of some bilateral market games
• The \({\mathcal B}\)-nucleolus of TU-games
• Operations research games: A survey. (With comments and rejoinder)
• Note on the computational complexity of least core concepts for min-cost spanning tree games.
• On the computation of the nucleolus of a cooperative game
• The nucleolus of arborescence games in directed acyclic graphs
• A simple procedure to compute the nucleolus of \(\Gamma\)-component additive games
• On the core of cost-revenue games: minimum cost spanning tree games with revenues
• A procedure to compute the nucleolus of the assignment game
• Core stability in chain-component additive games
• On the complexity of nucleolus computation for bipartite \(b\)-matching games
• On computing the nucleolus of a balanced connected game
• The complexity of the nucleolus in compact games
• On the core and nucleolus of minimum cost spanning tree games
• The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties
• A COMPUTATIONAL APPROACH TO THE COINCIDENCE OF EGALITARIAN SOLUTIONS FOR COST-SHARING GAMES
• Finding nucleolus of flow game
• A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure
• The integer nucleolus of directed simple games: a characterization and an algorithm
• The nucleolus of trees with revenues

This page was built for publication: Computing the nucleolus of some combinatorially-structured games.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587940)