BIT Numerical Mathematics

, Volume 10, Issue 3, pp 295–309

Stable marriage assignment for unequal sets

Authors

  • D. G. McVitie
    • I. C. L. Kidsgrove
    • University Computing LaboratoryUniversity of Newcastle Upon Tyne
  • L. B. Wilson
    • I. C. L. Kidsgrove
    • University Computing LaboratoryUniversity of Newcastle Upon Tyne
Article

DOI: 10.1007/BF01934199

Cite this article as:
McVitie, D.G. & Wilson, L.B. BIT (1970) 10: 295. doi:10.1007/BF01934199

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.

Copyright information

© BIT Foundations 1970