On finding the nucleolus of an \(n\)-person cooperative game
From MaRDI portal
Publication:810387
DOI10.1007/BF01766424zbMath0733.90083OpenAlexW2020121184MaRDI QIDQ810387
Publication date: 1991
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01766424
Large-scale problems in mathematical programming (90C06) Abstract computational complexity for mathematical programming problems (90C60) Cooperative games (91A12) Linear programming (90C05) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Related Items
An algorithm for finding the nucleolus of assignment games ⋮ Finding the nucleoli of large cooperative games ⋮ Finding the nucleolus of any \(n\)-person cooperative game by a single linear program ⋮ Aggregate wind power production via coalitional games and optimal control ⋮ Characterization sets for the nucleolus in balanced games ⋮ The simplified modified nucleolus of a cooperative TU-game ⋮ Finding and verifying the nucleolus of cooperative games ⋮ Finding the nucleolus of the vehicle routing game with time windows ⋮ Analytic solution for the nucleolus of a three-player cooperative game ⋮ The Complexity of the Nucleolus in Compact Games ⋮ Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory ⋮ A heuristic procedure for computing the nucleolus
Cites Work
This page was built for publication: On finding the nucleolus of an \(n\)-person cooperative game