Abstract
An algorithm for assigning the members of two disjoint equal sets to each other under the criterion of Stable Marriage is analysed and the results compared to the experimental results obtained on a computer. The number of comparisons is shown to be of ordern logn (wheren is the size of the sets) which is better than that achieved by algorithms for solving the Classical Assignment Problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Silver,An Algorithm for the Assignment Problem, Comm. of ACM. Vol. 3 (1960), 605–606. Also ACM Algorithm 27, 603–604.
J. F. Desler and S. L. Hakimi,A Graph-Theoretic Approach to a class of Integer-Programming Problems, Operations Research Vol. 17 (1969), 1017–1033.
D. Gale and L. S. Shapley,College Admissions and the Stability of Marriage, Amer. Math. Monthly Vol. 69 (1962), 9–15.
D. G. McVitie and L. B. Wilson,The Stable Marriage Problem, Comm. of ACM. Vol. 14, No. 7. (July 1971), 486–490.
D. G. McVitie and L. B. Wilson,Three Procedures for the Stable Marriage Problem, ACM Algorithm 411. Comm. of the ACM Vol. 14, No. 7. (July 1971), 491–492.
D. G. McVitie and L. B. Wilson,Stable Marriage Assignment for Unequal Sets, BIT 10 (1970), 295–309.
W. Feller,An Introduction to Probability Theory and its Applications, Vol. 1 (3rd edition), 118–125. John Wiley & Sons, Inc. 1968.
E. S. Page,A note on generating random permutations, Appl. Statistics. Vol. 16 (1959), 273–274.
P. A. W. Lewis, A. S. Goodman and J. M. Miller,A Pseudo-random number generator for the System/360, IBM Systems Journal Vol. 8, No. 2 (1969), 136–146.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wilson, L.B. An analysis of the stable marriage assignment algorithm. BIT 12, 569–575 (1972). https://doi.org/10.1007/BF01932966
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01932966