Skip to main content
Log in

A parallel algorithm to solve the stable marriage problem

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

In this paper a parallel algorithm to solve the stable marriage problem is given. The worst case performance of this algorithm is stated. A theoretical analysis shows that the probability of the occurrence of this worst case is extremely small. For instance, if there are sixteen men and sixteen women involved, then the probability that the worst case occurs is only 10−45. Possible future research is also discussed in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. L. Allison,Stable marriages by coroutines, Information Processing Letters, Vol. 16, No. 2 (Feb. 1983), 61–65.

    Google Scholar 

  2. J. L. Bentley,Multidimensional Divide-and-conquer, Communications of the ACM, Vol. 23, No. 4, (Apr. 1980), 214–239.

    Google Scholar 

  3. D. Gale and L. S. Shapley,College admissions and the stability of marriage, Am. Math. Monthly 69 (1962), 9–15.

    Google Scholar 

  4. F. S. Hiller and G. J. Lieberman,Introduction to Operations Research, 3rd ed., Holden-Day, San Francisco (1980).

    Google Scholar 

  5. D. G. McVitie and L. B. Wilson,Stable marriage assignment for unequal sets, BIT 10 (1970), 295–309.

    Google Scholar 

  6. D. G. McVitie and L. B. Wilson,The stable marriage problem, Communications of the ACM, Vol. 14, No. 7, (July 1971), 486–490.

    Google Scholar 

  7. D. G. McVitie and L. B. Wilson, Algorithm 411, Pts. 1–3,Three procedures for the stable marriage problem, Communications of the ACM, Vol. 14, No. 7, (July 1971), 491–492.

    Google Scholar 

  8. L. B. Wilson,An analysis of the stable marriage assignment algorithm, BIT 12 (1972), 569–575.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tseng, S.S., Lee, R.C.T. A parallel algorithm to solve the stable marriage problem. BIT 24, 308–316 (1984). https://doi.org/10.1007/BF02136029

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02136029

Keywords

Navigation