Faster and Simpler Approximation of Stable Matchings

We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m) time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(n3/2m) time, where n denotes the number of people andm is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extension of the algorithm for computing stable many-to-many matchings.

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

[2]  Shuichi Miyazaki,et al.  A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem , 2004, SWAT.

[3]  Kurt Mehlhorn,et al.  A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..

[4]  Aytek Erdil,et al.  What's the Matter with Tie-Breaking? Improving Efficiency in School Choice , 2008 .

[5]  Magnús M. Halldórsson,et al.  Improved approximation results for the stable marriage problem , 2007, TALG.

[6]  Shuichi Miyazaki,et al.  A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties , 2010, Algorithmica.

[7]  Katarzyna E. Paluch.  Faster and Simpler Approximation of Stable Matchings , 2011, WAOA.

[8]  Chak-Kuen Wong,et al.  A faster approximation algorithm for the Steiner problem in graphs , 1986, Acta Informatica.

[9]  David P. Williamson,et al.  Faster approximation algorithms for the minimum latency problem , 2003, SODA '03.

[10]  L. Lovász,et al.  Annals of Discrete Mathematics , 1986 .

[11]  Shuichi Miyazaki,et al.  A 1.875: approximation algorithm for the stable marriage problem , 2006, SODA '07.

[12]  M HalldórssonMagnús,et al.  Improved approximation results for the stable marriage problem , 2007 .

[13]  Zoltán Király,et al.  Better and Simpler Approximation Algorithms for the Stable Marriage Problem , 2008, Algorithmica.

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

[15]  Shuichi Miyazaki,et al.  A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem , 2005, ISAAC.

[16]  Shuichi Miyazaki,et al.  A (2 - clog N/N)-Approximation Algorithm for the Stable Marriage Problem , 2006, IEICE Trans. Inf. Syst..

[17]  Shuichi Miyazaki,et al.  A ( $2-c\frac{1}{\sqrt{N}}$ )-Approximation Algorithm for the Stable Marriage Problem , 2007, Algorithmica.

[18]  Kazuo Iwama,et al.  A -Approximation Algorithm for the Stable Marriage Problem , 2006 .

[19]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[20]  Shuichi Miyazaki,et al.  A (2-c(logN)/N)-Approximation Algorithm for the Stable Marriage Problem( Invited Papers from New Horizons in Computing) , 2006 .

[21]  Eric McDermid.  A 3/2-Approximation Algorithm for General Stable Marriage , 2009, ICALP.

[22]  Hiroki Yanagisawa.  Approximation algorithms for stable marriage problems , 2007 .

[23]  David Manlove,et al.  Finding large stable matchings , 2009, JEAL.

[24]  Parag A. Pathak,et al.  Strategy-Proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match , 2009 .