The nucleon of cooperative games and an algorithm for matching games
From MaRDI portal
Publication:1290660
Recommendations
- scientific article; zbMATH DE number 4152185
- On the computation of the nucleolus of a cooperative game
- scientific article; zbMATH DE number 1187071
- On finding the nucleolus of an \(n\)-person cooperative game
- Finding and verifying the nucleolus of cooperative games
- scientific article; zbMATH DE number 6007910
- scientific article; zbMATH DE number 4147886
- The general nucleolus of \(n\)-person cooperative games
Cites work
- scientific article; zbMATH DE number 4027489 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 1263283 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- A Monge property for the \(d\)-dimensional transportation problem
- Generalized polymatroids and submodular flows
- Monge sequences and a simple assignment algorithm
- Perspectives of Monge properties in optimization
Cited in
(14)- The complexity of matching games: a survey
- The general graph matching game: approximate core
- Population monotonicity in matching games
- A note on the nucleolus of assignment games.
- Computing solutions for matching games
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value
- The nucleolus is well-posed
- Approximate core allocations for edge cover games
- On the vertices of the \(k\)-additive core
- Efficient stabilization of cooperative matching games
- An algorithm for finding the nucleolus of assignment games
- scientific article; zbMATH DE number 6285120 (Why is no real title available?)
- Simple games versus weighted voting games: bounding the critical threshold value
- On the nucleolus of neighbor games
This page was built for publication: The nucleon of cooperative games and an algorithm for matching games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290660)