Jointly stable matchings
From MaRDI portal
Publication:5136277
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05) Abstract computational complexity for mathematical programming problems (90C60) Matching models (91B68)
Recommendations
Cites work
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A polynomial-time algorithm for the bistable roommates problem
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- Bistable versions of the marriages and roommates problems
- College Admissions and the Stability of Marriage
- Concerning the maximum number of stable matchings in the stable marriage problem
- On the Complexity of Timetable and Multicommodity Flow Problems
- Some remarks on the stable matching problem
- Stable marriage and indifference
- The Complexity of Counting Stable Marriages
- The set of super-stable marriages forms a distributive lattice
- The structure of stable marriage with indifference
Cited in
(4)
This page was built for publication: Jointly stable matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136277)
