Skip to main content
SpringerLink
Log in

Stable marriage assignment for unequal sets

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The theory and algorithms developed by the authors in a previous paper for the stable marriage assignment for equal sets are extended to the case of unequal sets. The main theorem in this paper shows that a person unmarried in one stable marriage solution will be unmarried in any other stable marriage solution.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Gale and L. S. Shapley,College Admissions and the Stability of Marriage, Amer. Math. Monthly 69 (1962), 9–15.

    Google Scholar 

  2. D. G. McVitie and L. B. Wilson,The Stable Marriage Problem, C.A.C.M. (to be published).

Download references

Author information

Authors and Affiliations

  1. I. C. L. Kidsgrove, Stoke-On-Trent, England

    D. G. McVitie & L. B. Wilson

  2. University Computing Laboratory, University of Newcastle Upon Tyne, England

    D. G. McVitie & L. B. Wilson

Authors
  1. D. G. McVitie
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. B. Wilson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

McVitie, D.G., Wilson, L.B. Stable marriage assignment for unequal sets. BIT 10, 295–309 (1970). https://doi.org/10.1007/BF01934199

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation