A generalization of the stable matching problem

DOI10.1016/0166-218X(93)E0154-QMaRDI QIDQ1804884zbMATH OpenFDO

Authors Jimmy J. M. Tan, Yuang-Cheh Hsueh

Publication date 17 May 1995

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(93)E0154-Q

zbMATH Keywords

stable matchingstable partitionstable roommates problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Individual preferences (91B08)

Recommendations

• Stable matchings and stable partitions^∗
• An efficient algorithm for the “stable roommates” problem
• On a generalization of the stable roommates problem
• A necessary and sufficient condition for the existence of a complete stable matching

Cites work

• A Generalization of the Stable Marriage Problem
• A necessary and sufficient condition for the existence of a complete stable matching
• An efficient algorithm for the “stable roommates” problem
• College Admissions and the Stability of Marriage
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 3558960 (Why is no real title available?)

Cited in

(35)

• An algorithm to compute the full set of many-to-many stable matchings.
• Optimal general matchings
• Improving man-optimal stable matchings by minimum change of preference lists
• Stability, optimality and manipulation in matching problems with weighted preferences
• Perfect matching interdiction problem restricted to a stable vertex
• The integral stable allocation problem on graphs
• The stable roommates problem with choice functions
• The roommate problem with externalities
• The core of housing markets from an agent's perspective: Is it worth sprucing up your home?
• One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences
• The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems
• Random paths to \(P\)-stability in the roommate problem
• A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings
• Stability against robust deviations in the roommate problem
• Finding a minimum-regret many-to-many Stable Matching
• On a generalization of the stable roommates problem
• A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
• von Neumann-Morgenstern farsightedly stable sets in two-sided matching
• A necessary and sufficient condition for the existence of a complete stable matching
• The Stable Roommates Problem with Choice Functions
• Analysis of stochastic matching markets
• Stable matchings and stable partitions^∗
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition
• The Maximum-Weight Stable Matching Problem: Duality and Efficiency
• scientific article; zbMATH DE number 5691235 (Why is no real title available?)
• Matching problem of electronic broker based on stable bipartite matching
• scientific article; zbMATH DE number 5211512 (Why is no real title available?)
• Planar matchings for weighted straight skeletons
• Planar Matchings for Weighted Straight Skeletons
• An algorithm for a super-stable roommates problem
• Structural and algorithmic results for stable cycles and partitions in the roommates problem
• Characterization of super-stable matchings
• A unified approach to finding good stable matchings in the hospitals/residents setting
• Rotations in the stable b-matching problem

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)