A unifying approach to the structures of the stable matching problems

DOI10.1016/0898-1221(91)90002-LzbMATH Open0732.68086OpenAlexW2095079040MaRDI QIDQ808729FDOQ808729

Authors Yuang-Cheh Hsueh

Publication date 1991

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(91)90002-l

zbMATH Keywords

stable marriage problemstable roommates problemfinite distributive latticeFaigle geometryset of basic wordsset of feasible wordsset of stable marriagesunifying approach

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
• scientific article; zbMATH DE number 45086
• The geometry of fractional stable matchings and its applications
• Stable matchings and stable partitions^∗
• On the stable marriage polytope

Cites work

• scientific article; zbMATH DE number 3871387 (Why is no real title available?)
• scientific article; zbMATH DE number 3970766 (Why is no real title available?)
• scientific article; zbMATH DE number 3777562 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3558960 (Why is no real title available?)
• scientific article; zbMATH DE number 3598539 (Why is no real title available?)
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• An efficient algorithm for the “stable roommates” problem
• College Admissions and the Stability of Marriage
• Every finite distributive lattice is a set of stable matchings
• Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
• Geometries on partially ordered sets
• The Complexity of Counting Stable Marriages
• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
• The greedy algorithm for partially ordered sets
• Three Fast Algorithms for Four Problems in Stable Marriage

Cited in

(8)

• 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?)
• Stability, optimality and manipulation in matching problems with weighted preferences
• Many-to-One Stable Matching: Geometry and Fairness
• Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition
• A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
• Stable roommates matchings, mirror posets, median graphs, and the local/global median phenomenon in stable matchings
• The Maximum-Weight Stable Matching Problem: Duality and Efficiency

This page was built for publication: A unifying approach to the structures of the stable matching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808729)