Stable marriage assignment for unequal sets
- Cite this article as:
- McVitie, D.G. & Wilson, L.B. BIT (1970) 10: 295. doi:10.1007/BF01934199
- 604 Downloads
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.