On solution concepts for matching games
From MaRDI portal
Recommendations
Cited in
(17)- The core of the matching game
- The stable fixtures problem with payments
- On the nucleolus of neighbor games
- The general graph matching game: approximate core
- On one-sided versus two-sided matching games
- On the complexity of nucleolus computation for bipartite \(b\)-matching games
- How to arrange a singles' party: coalition formation in matching game
- Computing the least-core and nucleolus for threshold cardinality matching games
- Graph stabilization: a survey
- The price of optimum: complexity and approximation for a matching game
- Matching Games: The Least Core and the Nucleolus
- Stabilization of capacitated matching games
- On the complexity of nucleolus computation for bipartite \(b\)-matching games
- The complexity of matching games: a survey
- Computing solutions for matching games
- Stabilization of capacitated matching games
- Computing the least-core and nucleolus for threshold cardinality matching games
This page was built for publication: On solution concepts for matching games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569069)