A survey of the stable marriage problem and its variants

被引:91
|
作者
Iwama, Kazuo [1 ]
Miyazaki, Shuichi [2 ]
机构
[1] Kyoto Univ, Grad Sch Informat, Sakyo Ku, Yoshida Hommachi, Kyoto 6068501, Japan
[2] Kyoto Univ, Acad Ctr Comp & Media Studies, Sakyo Ku, Kyoto 6068501, Japan
关键词
D O I
10.1109/ICKS.2008.7
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The stable marriage problem is to find a matching between men and women, considering preference lists in. which. each person expresses his/her preference over the members of the opposite gender. The output matching must be stable, which, intuitively means that there is no man-woman pair both. of which have incentive to elope. This problem was introduced in 1962 in the seminal paper of Gale and Shapley, and has attracted researchers in several areas, including mathematics, economics, game theory, computer science, etc. This paper introduces old and recent results on the stable marriage problem and some other related problems.
引用
收藏
页码:131 / +
页数:3
相关论文
共 50 条
  • [1] LOWER BOUNDS FOR THE STABLE MARRIAGE PROBLEM AND ITS VARIANTS
    NG, C
    HIRSCHBERG, DS
    SIAM JOURNAL ON COMPUTING, 1990, 19 (01) : 71 - 77
  • [2] LOWER BOUNDS FOR THE STABLE MARRIAGE PROBLEM AND ITS VARIANTS
    NG, C
    30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 129 - 133
  • [3] An Approach to Robustness in the Stable Roommates Problem and Its Comparison with the Stable Marriage Problem
    Genc, Begum
    Siala, Mohamed
    Simonin, Gilles
    O'Sullivan, Barry
    INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2019, 2019, 11494 : 320 - 336
  • [4] Improved approximation algorithms for two variants of the stable marriage problem with ties
    Huang, Chien-Chung
    Kavitha, Telikepalli
    MATHEMATICAL PROGRAMMING, 2015, 154 (1-2) : 353 - 380
  • [5] A Quantum Annealing Approach for Solving Hard Variants of the Stable Marriage Problem
    Roch, Christoph
    Winderl, David
    Linnhoff-Popien, Claudia
    Feld, Sebastian
    INNOVATIONS FOR COMMUNITY SERVICES, I4CS 2022, 2022, 1585 : 294 - 307
  • [6] Improved approximation algorithms for two variants of the stable marriage problem with ties
    Chien-Chung Huang
    Telikepalli Kavitha
    Mathematical Programming, 2015, 154 : 353 - 380
  • [7] Hard variants of stable marriage
    Manlove, DF
    Irving, RW
    Iwama, K
    Miyazaki, S
    Morita, Y
    THEORETICAL COMPUTER SCIENCE, 2002, 276 (1-2) : 261 - 279
  • [8] STABLE MARRIAGE PROBLEM
    MCVITIE, DG
    WILSON, LB
    COMMUNICATIONS OF THE ACM, 1971, 14 (07) : 486 - &
  • [9] A Survey on the Densest Subgraph Problem and Its Variants
    Lanciano, Tommaso
    Miyauchi, Atsushi
    Fazzone, Adriano
    Bonchi, Francesco
    ACM COMPUTING SURVEYS, 2024, 56 (08)
  • [10] A Note on the Stable Marriage Problem
    Zivkovic D.
    SN Computer Science, 2020, 1 (2)