A unifying approach to the structures of the stable matching problems

DOI10.1016/0898-1221(91)90002-LzbMath0732.68086OpenAlexW2095079040MaRDI QIDQ808729

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

finite distributive latticestable marriage problemstable roommates problemFaigle 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Every finite distributive lattice is a set of stable matchings
• The greedy algorithm for partially ordered sets
• Geometries on partially ordered sets
• Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
• An efficient algorithm for the “stable roommates” problem
• The Complexity of Counting Stable Marriages
• Three Fast Algorithms for Four Problems in Stable Marriage
• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
• College Admissions and the Stability of Marriage

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