A generalization of the stable matching problem
From MaRDI portal
Publication:1804884
DOI10.1016/0166-218X(93)E0154-QzbMATH Open0827.90120MaRDI QIDQ1804884FDOQ1804884
Jimmy J. M. Tan, Yuang-Cheh Hsueh
Publication date: 17 May 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- College Admissions and the Stability of Marriage
- A necessary and sufficient condition for the existence of a complete stable matching
- An efficient algorithm for the “stable roommates” problem
- A Generalization of the Stable Marriage Problem
Cited In (30)
- Title not available (Why is that?)
- Improving man-optimal stable matchings by minimum change of preference lists
- Rotations in the stable \(b\)-matching problem
- Characterization of super-stable matchings
- Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition
- One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences
- The Maximum-Weight Stable Matching Problem: Duality and Efficiency
- A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings
- Optimal general matchings
- A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
- von Neumann-Morgenstern farsightedly stable sets in two-sided matching
- The stable roommates problem with choice functions
- An algorithm to compute the full set of many-to-many stable matchings.
- The integral stable allocation problem on graphs
- The roommate problem with externalities
- Random paths to \(P\)-stability in the roommate problem
- The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems
- Finding a minimum-regret many-to-many Stable Matching
- Planar Matchings for Weighted Straight Skeletons
- The core of housing markets from an agent's perspective: Is it worth sprucing up your home?
- A necessary and sufficient condition for the existence of a complete stable matching
- Perfect matching interdiction problem restricted to a stable vertex
- The Stable Roommates Problem with Choice Functions
- Planar Matchings for Weighted Straight Skeletons
- Stability against robust deviations in the roommate problem
- A unified approach to finding good stable matchings in the hospitals/residents setting
- Title not available (Why is that?)
- Analysis of stochastic matching markets
- Stability, optimality and manipulation in matching problems with weighted preferences
- Stable matchings and stable partitions∗
This page was built for publication: A generalization of the stable matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804884)