Jointly stable matchings
From MaRDI portal
Publication:5136277
DOI10.4230/LIPICS.ISAAC.2017.56zbMATH Open1457.90131MaRDI QIDQ5136277FDOQ5136277
Authors: Shuichi Miyazaki, Kazuya Okamoto 
Publication date: 25 November 2020
Recommendations
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)
Cites Work
- Some remarks on the stable matching problem
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- The Complexity of Counting Stable Marriages
- Title not available (Why is that?)
- College Admissions and the Stability of Marriage
- On the Complexity of Timetable and Multicommodity Flow Problems
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- Stable marriage and indifference
- The structure of stable marriage with indifference
- A polynomial-time algorithm for the bistable roommates problem
- The set of super-stable marriages forms a distributive lattice
- Concerning the maximum number of stable matchings in the stable marriage problem
- Bistable versions of the marriages and roommates problems
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)
