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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• The Complexity of Counting Stable Marriages
• Three Fast Algorithms for Four Problems in Stable Marriage
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• College Admissions and the Stability of Marriage
• Every finite distributive lattice is a set of stable matchings
• Title not available (Why is that?)
• An efficient algorithm for the “stable roommates” problem
• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Stability and strategy-proofness for matching with constraints: A necessary and sufficient condition
• The Maximum-Weight Stable Matching Problem: Duality and Efficiency
• A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
• Many-to-One Stable Matching: Geometry and Fairness
• A unified approach to finding good stable matchings in the hospitals/residents setting
• Stable roommates matchings, mirror posets, median graphs, and the local/global median phenomenon in stable matchings
• Title not available (Why is that?)
• Stability, optimality and manipulation in matching problems with weighted preferences

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)