Solutions for the stable roommates problem with payments
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Accessible outcomes versus absorbing outcomes
- Approximation and Online Algorithms
- College Admissions and the Stability of Marriage
- Computing solutions for matching games
- Random Paths to Stability in Two-Sided Matching
- Random paths to stability in the roommate problem
- Some simplified NP-complete graph problems
- Stable outcomes of the roommate game with transferable utility
- The assignment game. I: The core
- The coalition structure core is accessible
Cited in
(14)- Stability properties of the core in a generalized assignment problem
- Exchange networks with stochastic matching
- Finding small stabilizers for unstable graphs
- The importance of memory for price discovery in decentralized markets
- The stable fixtures problem with payments
- The stable fixtures problem with payments
- The complexity of matching games: a survey
- Additive stabilizers for unstable graphs
- Stabilizing network bargaining games by blocking players
- Dynamics in matching and coalition formation games with structural constraints
- Stabilizing weighted graphs
- Stabilizing weighted graphs
- Solutions for the stable roommates problem with payments
- Efficient stabilization of cooperative matching games
This page was built for publication: Solutions for the stable roommates problem with payments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453162)