Three-dimensional stable matching with cyclic preferences

被引：6
|
作者：
Pashkovich, Kanstantsin [1 ]
Poirrier, Laurent [2 ]
机构：
[1] Univ Ottawa, Sch Comp Sci & Elect Engn, 800 King Edward Ave, Ottawa, ON K1N 6N5, Canada
[2] Univ Waterloo, Dept Combinator & Optimizat, 200 Univ Ave West, Waterloo, ON N2L 3G1, Canada
来源：
OPTIMIZATION LETTERS | 2020年 / 14卷 / 08期
基金：
加拿大自然科学与工程研究理事会;
关键词：
Stable matching; Three-dimensional; Matching; Stable;
D O I：
10.1007/s11590-020-01557-4
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider the three-dimensional stable matching problem with cyclic preferences, a problem originally proposed by Knuth. In 2004, Boros, Gurvich, Jaslar and Krasner showed that a stable matching always exists when the number of agents in each of the groups is three. In 2006, Eriksson, Sjostrand and Strimling showed that a stable matching exists also when the number of agents in each group is four. In this paper, we demonstrate that a stable matching exists when each group has five agents. Furthermore, we show that there are at least two distinct stable matchings in that setting.
引用
收藏
页码：2615 / 2623
页数：9
相关论文
共 50 条
  • [1] Three-dimensional stable matching with cyclic preferences
    Eriksson, Kirnmo
    Sjostrand, Jonas
    Strimling, Pontus
    MATHEMATICAL SOCIAL SCIENCES, 2006, 52 (01) : 77 - 87
  • [2] Three-dimensional stable matching with cyclic preferences
    Kanstantsin Pashkovich
    Laurent Poirrier
    Optimization Letters, 2020, 14 : 2615 - 2623
  • [3] Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
    Cseh, Agnes
    Escamocher, Guillaume
    Quesada, Luis
    CONSTRAINTS, 2023, 28 (02) : 138 - 165
  • [4] Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
    Ágnes Cseh
    Guillaume Escamocher
    Luis Quesada
    Constraints, 2023, 28 : 138 - 165
  • [5] Three-dimensional stable matching with hybrid preferences
    Feng Zhang
    Jing Li
    Junxiang Fan
    Huili Shen
    Jian Shen
    Hua Yu
    Journal of Combinatorial Optimization, 2019, 37 : 330 - 336
  • [6] Three-dimensional stable matching with hybrid preferences
    Zhang, Feng
    Li, Jing
    Fan, Junxiang
    Shen, Huili
    Shen, Jian
    Yu, Hua
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (01) : 330 - 336
  • [7] A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences
    Ágnes Cseh
    Guillaume Escamocher
    Begüm Genç
    Luis Quesada
    Constraints, 2022, 27 : 249 - 283
  • [8] A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences
    Cseh, Agnes
    Escamocher, Guillaume
    Genc, Begum
    Quesada, Luis
    CONSTRAINTS, 2022, 27 (03) : 249 - 283
  • [9] On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences
    Lam, Chi-Kit
    Plaxton, C. Gregory
    THEORY OF COMPUTING SYSTEMS, 2022, 66 (03) : 679 - 695
  • [10] On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences
    Chi-Kit Lam
    C. Gregory Plaxton
    Theory of Computing Systems, 2022, 66 : 679 - 695
12345