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.
Similar content being viewed by others
References
D. Gale and L. S. Shapley,College Admissions and the Stability of Marriage, Amer. Math. Monthly 69 (1962), 9–15.
D. G. McVitie and L. B. Wilson,The Stable Marriage Problem, C.A.C.M. (to be published).
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01934199