The B-nucleolus of TU-games
From MaRDI portal
Publication:1268656
Recommendations
Cites work
- scientific article; zbMATH DE number 3728060 (Why is no real title available?)
- scientific article; zbMATH DE number 592686 (Why is no real title available?)
- An algorithm for finding the nucleolus of assignment games
- Computing the Nucleolus by Solving a Prolonged Simplex Algorithm
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- On the Nucleolus of a Characteristic Function Game
- Strongly balanced cooperative games
- The assignment game. I: The core
- The general nucleolus and the reduced game property
- The kernel/nucleolus of a standard tree game
- Values of Graph-Restricted Games
- \(\Gamma\)-component additive games
Cited in
(16)- Bargaining property of nucleolus and \(\tau\)-value in a class of TU-games
- The nucleolus and inheritance of properties in communication situations
- Finding and verifying the nucleolus of cooperative games
- Characterization sets for the nucleolus in balanced games
- The least square prenucleolus and the least square nucleolus. Two values for TU games based on the excess vector
- Weighted nucleoli and dually essential coalitions
- The prenucleolus for games with restricted cooperation
- Determining the nucleolus of compromise stable games
- The complexity of the nucleolus in compact games
- A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure
- The nucleolus of balanced simple flow networks
- A heuristic procedure for computing the nucleolus
- Finding the nucleoli of large cooperative games
- Considerations on the aggregate monotonicity of the nucleolus and the core-center
- On the core and nucleolus of directed acyclic graph games
- TU-games with utilities: the prenucleolus and its characterization set
This page was built for publication: The \({\mathcal B}\)-nucleolus of TU-games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268656)