Approximation algorithms for the sex-equal stable marriage problem

The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial time algorithm to find one. However, the matching obtained by this algorithm is man-optimal, that is, the matching is favorable for men but unfavorable for women, (or, if we exchange the roles of men and women, the resulting matching is woman-optimal). The sex-equal stable marriage problem, posed by Gusfield and Irving, seeks a stable matching “fair” for both genders. Specifically it seeks a stable matching with the property that the sum of the men's scores is as close as possible to that of the women's. This problem is known to be strongly NP-hard. In this paper, we give a polynomial time algorithm for finding a near optimal solution for the sex-equal stable marriage problem. Furthermore, we consider the problem of optimizing an additional criterion: among stable matchings that are near optimal in terms of the sex-equality, find a minimum egalitarian stable matching. We show that this problem is strongly NP-hard, and give a polynomial time algorithm whose approximation ratio is less than two.

[1]  Akiko Kato,et al.  Complexity of the sex-equal stable marriage problem , 1993 .

[2]  Stavros G. Kolliopoulos,et al.  Partially ordered knapsack and applications to scheduling , 2007, Discret. Appl. Math..

[3]  Tomás Feder,et al.  A New Fixed Point Approach for Stable Networks and Stable Marriages , 1992, J. Comput. Syst. Sci..

[4]  D. S. Johnson,et al.  On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees , 1983, Math. Oper. Res..

[5]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

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

[7]  Refael Hassin,et al.  Complexity of finding dense subgraphs , 2002, Discret. Appl. Math..

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

[9]  Subhash Khot,et al.  Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[10]  Moses Charikar,et al.  Maximizing quadratic programs: extending Grothendieck's inequality , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[11]  Y. Nesterov.  Semidefinite relaxation and nonconvex quadratic optimization , 1998 .

[12]  Robert W. Irving,et al.  The Complexity of Counting Stable Marriages , 1986, SIAM J. Comput..

[13]  Tomás Feder,et al.  Network flow and 2-satisfiability , 1994, Algorithmica.

[14]  Robert W. Irving,et al.  An efficient algorithm for the “optimal” stable marriage , 1987, JACM.

[15]  Dan Gusfield,et al.  Three Fast Algorithms for Four Problems in Stable Marriage , 1987, SIAM J. Comput..

[16]  Antonio Romero-Medina,et al.  `Sex-Equal' Stable Matchings , 2001 .

[17]  Uriel Feige,et al.  Relations between average case complexity and approximation complexity , 2002, STOC '02.

[18]  Michael E. Saks,et al.  Every finite distributive lattice is a set of stable matchings for a small stable marriage instance , 1987, J. Comb. Theory, Ser. A.

[19]  Charles Eugene Blair,et al.  Every Finite Distributive Lattice Is a Set of Stable Matchings , 1984, J. Comb. Theory A.

[20]  Paul S. Bonsma.  Most balanced minimum cuts and partially ordered knapsack , 2007, CTW.