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)

zbMATH Keywords

stable matchingstable roommates problemstable partition

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 3558960 (Why is no real title available?)
• 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

Cited in

(33)

• scientific article; zbMATH DE number 5211512 (Why is no real title available?)
• Improving man-optimal stable matchings by minimum change of preference lists
• Rotations in the stable \(b\)-matching problem
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• 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
• A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings
• The Maximum-Weight Stable Matching Problem: Duality and Efficiency
• 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
• Stability against robust deviations in the roommate problem
• An algorithm for a super-stable roommates problem
• A unified approach to finding good stable matchings in the hospitals/residents setting
• scientific article; zbMATH DE number 5691235 (Why is no real title available?)
• Analysis of stochastic matching markets
• Planar matchings for weighted straight skeletons
• Stability, optimality and manipulation in matching problems with weighted preferences
• Stable matchings and stable partitions^∗
• Matching problem of electronic broker based on stable bipartite matching

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)