Skip to main content
SpringerLink
Log in

On the decomposability of the stable marriage problem

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Gale and L. S. Shapley,College admissions and the stability of marriage, Am. Math. Monthly, 69 (1962), 9–15.

    Google Scholar 

  2. M. Hall,The Theory of Groups, The Macmillan Company, New York, 1959.

    Google Scholar 

  3. S. S. Tseng and R. C. T. Lee,A parallel algorithm to solve the stable marriage problem, BIT 24 (1984), 308–316.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lawrence Berkeley Laboratory, University of California, 94720, Berkeley, CA, USA

    Eugene Veklerov

Authors
  1. Eugene Veklerov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work has been supported by the U.S. Department of Energy under Contract No. DE-AC03-76SF00098.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01932704

CR Categories

Keywords

Search

Navigation