Computing the Nucleolus by Solving a Prolonged Simplex Algorithm
From MaRDI portal
Recommendations
Cited in
(22)- The \({\mathcal B}\)-nucleolus of TU-games
- An algorithm for finding the nucleolus of assignment games
- The nucleolus and kernel of veto-rich transferable utility games
- On the 1-nucleolus
- Characterization sets for the nucleolus in balanced games
- Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach
- Finding the nucleolus of the vehicle routing game with time windows
- Finding and verifying the nucleolus of cooperative games
- A heuristic procedure for computing the nucleolus
- On the lexicographic centre of multiple objective optimization
- A note on the nucleolus of assignment games.
- The complexity of the nucleolus in compact games
- Analytic solution for the nucleolus of a three-player cooperative game
- Finding the nucleoli of large cooperative games
- Finding the nucleolus of any n-person cooperative game by a single linear program
- scientific article; zbMATH DE number 1187070 (Why is no real title available?)
- SIMPLICIAL ALGORITHM FOR COMPUTING A CORE ELEMENT IN A BALANCED GAME
- The least square nucleolus is a normalized Banzhaf value
- The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties
- scientific article; zbMATH DE number 2196471 (Why is no real title available?)
- Constructive and blocking power in collaborative transportation
- The nucleolus of balanced simple flow networks
This page was built for publication: Computing the Nucleolus by Solving a Prolonged Simplex Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4716936)
