Communications of the ACM · 1971 · 397 citations · 2 references
Natural SciencesComputer ScienceMathematicsAlgorithmsDiscrete MathematicsOptimizationAssignment ProblemsMarriageMarriage ProblemMatching Problems
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.
2