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
来源：
INTERNATIONAL CONFERENCE ON INFORMATICS EDUCATION AND RESEARCH FOR KNOWLEDGE-CIRCULATING SOCIETY, PROCEEDINGS | 2008年
关键词：
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 条
  • [41] A specialised binary constraint for the stable marriage problem
    Unsworth, C
    Prosser, P
    ABSTRACTION, REFORMULATION AND APPROXIMATION, PROCEEDINGS, 2005, 3607 : 218 - 233
  • [42] Improved Approximation Results for the Stable Marriage Problem
    Halldorsson, Magnus M.
    Iwama, Kazuo
    Miyazaki, Shuichi
    Yanagisawa, Hiroki
    ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (03)
  • [43] A bidirectional local search for the stable marriage problem
    Hoang Huu Viet
    Le Hong Trang
    Lee, SeungGwan
    Chung, TaeChoong
    2016 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING AND APPLICATIONS (ACOMP), 2016, : 18 - 24
  • [44] A diagrammatic classification in a combinatorial problem: the case of the stable marriage problem
    Hayashi, T.
    Hata, Y.
    Ishida, Y.
    ARTIFICIAL LIFE AND ROBOTICS, 2012, 16 (04) : 575 - 579
  • [45] A Diagrammatic Classification in a Combinatorial Problem: The Case of a Stable Marriage Problem
    Hayashi, T.
    Hata, Y.
    Ishida, Y.
    PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL SYMPOSIUM ON ARTIFICIAL LIFE AND ROBOTICS (AROB 16TH '11), 2011, : 491 - 494
  • [46] Multiple stable states in microbial communities explained by the stable marriage problem
    Goyal, Akshit
    Dubinkina, Veronika
    Maslov, Sergei
    ISME JOURNAL, 2018, 12 (12): : 2823 - 2834
  • [47] Multiple stable states in microbial communities explained by the stable marriage problem
    Akshit Goyal
    Veronika Dubinkina
    Sergei Maslov
    The ISME Journal, 2018, 12 : 2823 - 2834
  • [48] A survey of the all-pairs shortest paths problem and its variants in graphs
    Reddy, K. R. Udaya Kumar
    ACTA UNIVERSITATIS SAPIENTIAE INFORMATICA, 2016, 8 (01) : 16 - 40
  • [49] Ant colony based algorithm for stable marriage problem
    Vien, Ngo Anh
    Viet, Nguyen Hoang
    Kim, Hyun
    Lee, SeungGwan
    Chung, TaeChoong
    ADVANCES AND INNOVATIONS IN SYSTEMS, COMPUTING SCIENCES AND SOFTWARE ENGINEERING, 2007, : 457 - +
  • [50] A 1.875-Approximation Algorithm for the Stable Marriage Problem
    Iwama, Kazuo
    Miyazaki, Shuichi
    Yamauchi, Naoya
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 288 - +
12345