Abstract
While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for incomplete preference lists and ties in the preferences. Either variation is polynomially solvable, but it has recently been shown to be NP-hard to find a maximum cardinality stable matching when both of the variations are allowed. It is easy to see that the size of any two stable matchings differ by at most a factor of two, and so, an approximation algorithm with a factor two is trivial. In this paper, we give a first nontrivial result for the approximation with factor less than two. Our randomized algorithm achieves a factor of 10/7 for a restricted but still NP-hard case, where ties occur in only men’s lists, each man writes at most one tie, and the length of ties is two. Furthermore, we show that these restrictions except for the last one can be removed without increasing the approximation ratio too much.
Supported in part by Scientific Research Grant, Ministry of Japan, 13480081
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Gale and L. S. Shapley, “College admissions and the stability of marriage,” Amer. Math. Monthly, Vol.69, pp.9–15, 1962.
D. Gale and M. Sotomayor, “Some remarks on the stable matching problem,” Discrete Applied Mathematics, Vol.11, pp.223–232, 1985.
D. Gusfield and R. W. Irving, “The Stable Marriage Problem: Structure and Algorithms,” MIT Press, Boston, MA, 1989.
M. Halldórsson, K. Iwama, S. Miyazaki and Y. Morita, “Inapproximability Results on Stable Marriage Problems,” Proc. LATIN2002, LNCS 2286, pp.554–568, 2002.
E. Halperin, “Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs,” Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 329–337, 2000.
R. W. Irving, “Stable marriage and indifference,” Discrete Applied Mathematics, Vol.48, pp.261–272, 1994.
K. Iwama, D. Manlove, S. Miyazaki, and Y. Morita, “Stable marriage with incomplete lists and ties,” In Proc. ICALP’99, LNCS 1644, pp. 443–452, 1999.
D. Manlove, R. W. Irving, K. Iwama, S. Miyazaki, Y. Morita, “Hard variants of stable marriage,” Theoretical Computer Science, Vol. 276, Issue 1–2, pp. 261–279, 2002.
B. Monien and E. Speckenmeyer, “Ramsey numbers and an approximation algorithm for the vertex cover problem,” Acta Inf., Vol. 22, pp. 115–123, 1985.
M. Yannakakis and F. Gavril,“Edge dominating sets in graphs,” SIAM J. Appl. Math., Vol. 38, pp. 364–372, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halldórsson, M., Iwama, K., Miyazaki, S., Yanagisawa, H. (2003). Randomized Approximation of the Stable Marriage Problem. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_35
Download citation
DOI: https://doi.org/10.1007/3-540-45071-8_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40534-4
Online ISBN: 978-3-540-45071-9
eBook Packages: Springer Book Archive