Computing solutions for matching games
From MaRDI portal
Recommendations
Cites work
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- An algorithm for finding the nucleolus of assignment games
- Approximation and Online Algorithms
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Consistency in one-sided assignment problems
- Game theory
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- scientific article; zbMATH DE number 1599890 (Why is no real title available?)
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- Integer Programming: Methods, Uses, Computations
- Matching Games: The Least Core and the Nucleolus
- On the computation of the nucleolus of a cooperative game
- Some simplified NP-complete graph problems
- Stable outcomes of the roommate game with transferable utility
- The assignment game. I: The core
- The Nucleolus of a Characteristic Function Game
- The nucleon of cooperative games and an algorithm for matching games
- Vertex packings: Structural properties and algorithms
Cited in
(26)- The core of the matching game
- The stable fixtures problem with payments
- Simple games versus weighted voting games: bounding the critical threshold value
- The general graph matching game: approximate core
- Population monotonicity in matching games
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
- Computer solution to the game of pure strategy
- Solutions for the stable roommates problem with payments
- On the complexity of nucleolus computation for bipartite \(b\)-matching games
- Arboricity games: the core and the nucleolus
- How to arrange a singles' party: coalition formation in matching game
- The stable fixtures problem with payments
- Computing the least-core and nucleolus for threshold cardinality matching games
- Shapley meets Shapley
- Stabilizing weighted graphs
- On solution concepts for matching games
- Analysis of stochastic matching markets
- Stabilizing weighted graphs
- The price of optimum: complexity and approximation for a matching game
- Efficient stabilization of cooperative matching games
- Matching Games: The Least Core and the Nucleolus
- On the complexity of nucleolus computation for bipartite \(b\)-matching games
- The complexity of matching games: a survey
- Partitioned matching games for international kidney exchange
- The investment management game: extending the scope of the notion of core
- Computing the least-core and nucleolus for threshold cardinality matching games
This page was built for publication: Computing solutions for matching games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662281)
