A heuristic procedure for computing the nucleolus
From MaRDI portal
Publication:2329720
Recommendations
- On finding the nucleolus of an \(n\)-person cooperative game
- Computing the Nucleolus by Solving a Prolonged Simplex Algorithm
- On the computation of the nucleolus of a cooperative game
- Finding the nucleoli of large cooperative games
- Finding the nucleolus of any \(n\)-person cooperative game by a single linear program
Cites work
- A note on the nucleolus
- A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure
- A procedure for finding the nucleolus of a cooperativen person game
- A procedure to compute the nucleolus of the assignment game
- A simple algorithm for the nucleolus of airport profit games
- An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution
- Approximate nucleolus-based revenue sharing in airline alliances
- Characterization sets for the nucleolus
- Common mistakes in computing the nucleolus
- Computing the Nucleolus by Solving a Prolonged Simplex Algorithm
- Computing the least-core and nucleolus for threshold cardinality matching games
- Computing the nucleolus of cyclic permutation games
- Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach
- Determining the nucleolus of compromise stable games
- Finding nucleolus of flow game
- Finding the nucleoli of large cooperative games
- Finding the nucleolus of any \(n\)-person cooperative game by a single linear program
- Game theory
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- On finding the nucleolus of an \(n\)-person cooperative game
- On the core and nucleolus of directed acyclic graph games
- On the nucleolus of neighbor games
- On the nucleolus of shortest path games
- The Least-Core and Nucleolus of Path Cooperative Games
- The Nucleolus as a Solution of a Minimization Problem
- The \({\mathcal B}\)-nucleolus of TU-games
- The asymptotic core, nucleolus and Shapley value of smooth market games with symmetric large players
- The complexity of the nucleolus in compact games
- The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties
- The nucleolus of arborescence games in directed acyclic graphs
- The nucleolus of large majority games
Cited in
(6)- The least square nucleolus is a normalized Banzhaf value
- scientific article; zbMATH DE number 1187070 (Why is no real title available?)
- On systems of quotas from bankruptcy perspective: the sampling estimation of the random arrival rule
- Finding the nucleolus of the vehicle routing game with time windows
- scientific article; zbMATH DE number 2196471 (Why is no real title available?)
- TU-games with utilities: the prenucleolus and its characterization set
This page was built for publication: A heuristic procedure for computing the nucleolus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329720)