Abstract
The idea of decomposability is applied to the stable marriage problem. The problem is said to be decomposable if all its stable solutions match the members of a subset of the men with the members of a subset of the woman and only with them. One necessary and three sufficient criteria for the decomposability are presented.
Similar content being viewed by others
References
D. Gale and L. S. Shapley,College admissions and the stability of marriage, Am. Math. Monthly, 69 (1962), 9–15.
M. Hall,The Theory of Groups, The Macmillan Company, New York, 1959.
S. S. Tseng and R. C. T. Lee,A parallel algorithm to solve the stable marriage problem, BIT 24 (1984), 308–316.
Author information
Authors and Affiliations
Additional information
This work has been supported by the U.S. Department of Energy under Contract No. DE-AC03-76SF00098.
Rights and permissions
About this article
Cite this article
Veklerov, E. On the decomposability of the stable marriage problem. BIT 29, 41–46 (1989). https://doi.org/10.1007/BF01932704
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01932704