Stable matchings and stable partitionsFootnote^∗

^∗ This research was supported by the National Science Council of the Republic of China under grant NSC80-0408-E-009-04.

References

• Gale , D. and Shapley , L. 1962 . College admissions and the stability of marriage . Amer. Math. Monthly , 69 : 9 – 15 .
   Web of Science ®Google Scholar
• Gale , D. and Sotomayor , M. 1985 . Some remarks on the stable matching problem . Discrete Appl. Math. , 11 : 223 – 232 .
   Web of Science ®Google Scholar
• Gusfield , D. and Irving , R. 1989 . The Stable Marriage Problem: Structure and Algorithms , Boston, MA : The MIT Press .
   Google Scholar
• Irving , R. 1985 . An efficient algorithm for the stable roommates problem . J. Algorithms , 6 : 577 – 595 .
   Web of Science ®Google Scholar
• Irving , R. and Leather , P. 1986 . The complexity of counting stable marriages . SIAM J. Comput. , 15 : 655 – 667 .
   Google Scholar
• Knuth , D. E. 1976 . Marriage Stables , Les Presses de I'Universite de Montreal . In French
   Google Scholar
• Tan , J. J. M. 1986 . A necessary and sufficient condition for the existence of a complete stable matching . J. Algorithms , 15 : 655 – 667 . to appear
   Google Scholar