d-dimensional stable matching with cyclic preferences
From MaRDI portal
Recommendations
- Three-dimensional stable matching with cyclic preferences
- Three-dimensional stable matching with cyclic preferences
- Three-sided stable matchings with cyclic preferences
- On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences
- Stable matchings in three-sided systems with cyclic preferences
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
- A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences
- The stability of many-to-many matching with max-min preferences
Cites work
- scientific article; zbMATH DE number 3558960 (Why is no real title available?)
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- Circular stable matching and 3-way kidney transplant
- College Admissions and the Stability of Marriage
- Core stability in hedonic coalition formation
- Nonexistence of stable threesome matchings
- Stable matchings in three-sided systems with cyclic preferences
- Three-Dimensional Stabl Matching Problems
- Three-dimensional stable matching with cyclic preferences
- Three-sided stable matchings with cyclic preferences
Cited in
(3)
This page was built for publication: \(d\)-dimensional stable matching with cyclic preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309847)