The \({\mathcal B}\)-nucleolus of TU-games
From MaRDI portal
Publication:1268656
DOI10.1006/game.1997.0629zbMath0910.90275OpenAlexW2116198645MaRDI QIDQ1268656
Hans Reijnierse, Jos A. M. Potters
Publication date: 18 October 1998
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/game.1997.0629
Related Items (12)
Finding the nucleoli of large cooperative games ⋮ The prenucleolus for games with restricted cooperation ⋮ Characterization sets for the nucleolus in balanced games ⋮ A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure ⋮ Finding and verifying the nucleolus of cooperative games ⋮ On the core and nucleolus of directed acyclic graph games ⋮ Weighted nucleoli and dually essential coalitions ⋮ Considerations on the aggregate monotonicity of the nucleolus and the core-center ⋮ The Complexity of the Nucleolus in Compact Games ⋮ A heuristic procedure for computing the nucleolus ⋮ The nucleolus and inheritance of properties in communication situations ⋮ The nucleolus of balanced simple flow networks
Cites Work
- Unnamed Item
- Unnamed Item
- Strongly balanced cooperative games
- The general nucleolus and the reduced game property
- An algorithm for finding the nucleolus of assignment games
- \(\Gamma\)-component additive games
- The kernel/nucleolus of a standard tree game
- The assignment game. I: The core
- Values of Graph-Restricted Games
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Computing the Nucleolus by Solving a Prolonged Simplex Algorithm
- On the Nucleolus of a Characteristic Function Game
This page was built for publication: The \({\mathcal B}\)-nucleolus of TU-games
