Characterization of super-stable matchings
From MaRDI portal
Publication:832893
Recommendations
- Characterisation of strongly stable matchings
- On a characterization of stable matchings
- A matroid generalization of the super-stable matching problem
- Essentially stable matchings
- A note on stable matchings
- Saturating stable matchings
- Stable matchings through fixed points and graphs
- A generalization of the stable matching problem
- Hyperuniform and rigid stable matchings
- Stable matchings with couples
Cites work
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 1405659 (Why is no real title available?)
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
- A 3/2-Approximation Algorithm for General Stable Marriage
- A \((1 + 1/e)\)-approximation algorithm for maximum stable matching with one-sided ties and incomplete lists
- A faster algorithm for the Strongly Stable \(b\)-Matching Problem
- An improved approximation algorithm for the stable marriage problem with one-sided ties
- Characterisation of strongly stable matchings
- Characterization of stable matchings as extreme points of a polytope
- Efficient algorithms for generalized stable marriage and roommates problems
- Faster and simpler approximation of stable matchings
- Linear programming brings marital bliss
- Linear time local approximation algorithm for maximum stable marriage
- Maintaining a topological order under edge insertions
- Rings of sets
- Stable marriage and indifference
- Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem
- The geometry of fractional stable matchings and its applications
- The set of super-stable marriages forms a distributive lattice
- The structure of stable marriage with indifference
This page was built for publication: Characterization of super-stable matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832893)
