d-dimensional stable matching with cyclic preferences
From MaRDI portal
Publication:309847
DOI10.1016/J.MATHSOCSCI.2016.04.006zbMATH Open1397.91472OpenAlexW2345331702MaRDI QIDQ309847FDOQ309847
Authors: Johannes Hofbauer 
Publication date: 7 September 2016
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2016.04.006
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
- Title not available (Why is that?)
- College Admissions and the Stability of Marriage
- Nonexistence of stable threesome matchings
- Stable matchings in three-sided systems with cyclic preferences
- Three-sided stable matchings with cyclic preferences
- Circular stable matching and 3-way kidney transplant
- Core stability in hedonic coalition formation
- Three-Dimensional Stabl Matching Problems
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- Three-dimensional stable matching 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)
