Abstract
The stable matching problem, also called the stable marriage problem, was first introduced by Gale and Shapley in 1962: In this problem, we are given two parties of men and women, and for each person in one party his/her preference list that orders the members of the other party. The question is to find a stable matching, i.e., a matching containing no pair (blocking pair) of man and woman who prefer each other to their current partners. The above paper gave a linear time algorithm, now called the Gale-Shapley algorithm, for this problem.
The problem has a wide range of real-world applications including assigning residents to hospitals, known as the hospital/residents problem, used in NRMP in US and in many other similar programs. For such large scale applications, however, the original setting that each preference list must be strict and complete is clearly unrealistic. Hence, the study of two natural relaxations, allowing ties and incomplete lists, has been started shortly after the Gale-Shapley paper, and before long it turned out that there are still linear time algorithms, namely the problem does not become inherently harder, if we allow either one of the two relaxations.
Download conference paper PDF
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwama, K. (2012). Approximability of Stable Matching Problems. In: Rahman, M.S., Nakano, Si. (eds) WALCOM: Algorithms and Computation. WALCOM 2012. Lecture Notes in Computer Science, vol 7157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28076-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-28076-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28075-7
Online ISBN: 978-3-642-28076-4
eBook Packages: Computer ScienceComputer Science (R0)
