D. G. McVitie
Abstract
The original work of Gale and Shapley on an assignment method using the stable marriage criterion has been extended to find all the stable marriage assignments. The algorithm derived for finding all the stable marriage assignments is proved to satisfy all the conditions of the problem. Algorithm 411 applies to this paper.
- 1 Gale, D., and Shapley, L.S. College admissions and the stability of marriage. Am. Math. Monthly 69 (1962), 9-15.Google Scholar
Cross Ref
- 2 McVitie, D.G., and Wilson, L.B. Algorithm 411, Pts. 1-3. Three procedures for the stable marriage problem. Comm. ACM 14, 7 (July 1971), 491-492. Google ScholarDigital Library
Recommendations
The exchange-stable marriage problem
In this paper we consider instances of stable matching problems, namely the classical stable marriage (SM) and stable roommates (SR) problems and their variants. In such instances we consider a stability criterion that has recently been proposed, that ...
Efficient algorithms for generalized Stable Marriage and Roommates problems
We consider a generalization of the Stable Roommates problem (sr), in which preference lists may be partially ordered and forbidden pairs may be present, denoted by srpf. This includes, as a special case, a corresponding generalization of the classical ...
Comments