Three-dimensional stable matching with cyclic preferences

From MaRDI portal
Publication:5898285

DOI10.1016/j.mathsocsci.2006.03.005zbMath1141.91625arXivmath/0411028OpenAlexW2131227819MaRDI QIDQ5898285

Pontus Strimling, Jonas Sjöstrand, Kimmo Eriksson

Publication date: 7 December 2006

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0411028




Related Items

\(d\)-dimensional stable matching with cyclic preferencesReview of the theory of stable matchings and contract systemsCounterexamples of small size for three-sided stable matching with cyclic preferencesComputing relaxations for the three-dimensional stable matching problem with cyclic preferencesMinimal instances with no weakly stable matching for three-sided problem with cyclic incomplete preferencesOn random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferencesReconsidering the existence of stable solutions in three-sided matching problems with mixed preferencesA counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferencesThree-sided stable matchings with cyclic preferencesCircular stable matching and 3-way kidney transplantThree-sided stable matching problem with two of them as cooperative partnersStable marriage with general preferencesThree-dimensional stable matching with cyclic preferencesGeometric stable roommatesHardness results for stable exchange problemsOn the existence of three-dimensional stable matchings with cyclic preferencesThree-sided matching problem with mixed preferencesMatching with ownershipA collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferencesBalanced weights and three-sided coalition formation



Cites Work