A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem

We propose an approximation algorithm for the problem of finding a maximum stable matching when both ties and unacceptable partners are allowed in preference lists. Our algorithm achieves the approximation ratio \(2 - c\frac{{\rm log} N}{N}\) for an arbitrarily positive constant c, where N denotes the number of men in an input. This improves the trivial approximation ratio of two.

[1]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003 .

[2]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[3]  Kurt Mehlhorn,et al.  Strongly Stable Matchings in Time O ( nm ) , 2003 .

[4]  Ewald Speckenmeyer,et al.  Ramsey numbers and an approximation algorithm for the vertex cover problem , 1985, Acta Informatica.

[5]  David Manlove,et al.  Hard variants of stable marriage , 2002, Theor. Comput. Sci..

[6]  Robert W. Irving.  Stable Marriage and Indifference , 1994, Discret. Appl. Math..

[7]  Magnús M. Halldórsson,et al.  Algorithm Theory - SWAT 2000 , 2000 .

[8]  David Manlove,et al.  The Hospitals/Residents Problem with Ties , 2000, SWAT.

[9]  Magnús M. Halldórsson,et al.  Improved Approximation of the Stable Marriage Problem , 2003, ESA.

[10]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[11]  José D. P. Rolim,et al.  Randomization and Approximation Techniques in Computer Science , 2002, Lecture Notes in Computer Science.

[12]  Piotr Berman,et al.  On the Approximation Properties of Independent Set Problem in Degree 3 Graphs , 1999, WADS.

[13]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[14]  Marek Karpinski,et al.  Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems , 1997, Algorithmica.

[15]  David Manlove,et al.  Strong Stability in the Hospitals/Residents Problem , 2003, STACS.

[16]  Katarína Cechlárová,et al.  On the complexity of exchange-stable roommates , 2002, Discret. Appl. Math..

[17]  David Manlove,et al.  Approximability results for stable marriage problems with ties , 2003, Theor. Comput. Sci..

[18]  Chung-Piaw Teo,et al.  Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications , 1999, IPCO.

[19]  David Gale,et al.  Some remarks on the stable matching problem , 1985, Discret. Appl. Math..

[20]  Vikas Bhushan,et al.  First Aid for the Match , 1997 .

[21]  Michele A. A. Zito,et al.  Randomised techniques in combinatorial algorithmics , 1999 .

[22]  Robert W. Irving.  Matching medical students to pairs of hospitals: a new variation on an old theme , 1998 .

[23]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[24]  David Manlove,et al.  Stable Marriage with Incomplete Lists and Ties , 1999, ICALP.

[25]  Chung-Piaw Teo,et al.  Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications , 1999, IPCO.

[26]  Kurt Mehlhorn,et al.  Pareto Optimality in House Allocation Problems , 2005, ISAAC.

[27]  Toshihide Ibaraki,et al.  Approximability of the Minimum Maximal Matching Problem in Planar Graphs , 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[28]  G. Italiano,et al.  Algorit[h]ms - ESA '98 : 6th Annual European Symposium, Venice, Italy, August 24-26, 1998 : proceedings , 1998 .

[29]  Kurt Mehlhorn,et al.  Rank-maximal matchings , 2004, TALG.

[30]  Marek Karpinski.  Polynominal Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems , 1997, RANDOM.

[31]  Eran Halperin,et al.  Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.

[32]  Tamás Fleiner,et al.  A Fixed-Point Approach to Stable Matchings and Some Applications , 2003, Math. Oper. Res..

[33]  Robert W. Irving.  Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-Known Theme , 1998, ESA.

[34]  Magnús M. Halldórsson,et al.  Randomized Approximation of the Stable Marriage Problem , 2003, COCOON.