Skip to main content

Distributed Stable Matching Problems

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNPSE,volume 3709)


We consider the Stable Marriage Problem and the Stable Roommates Problem, two well-known types of the general class of Stable Matching Problems. They are combinatorial problems which can be solved by centralized algorithms in polynomial time. This requires to make public lists of preferences which agents would like to keep private. With this aim, we define the distributed version of these problems, and we provide a constraint-based approach that solves them keeping privacy. We give empirical results on the proposed approach.


  • Constraint Satisfaction Problem
  • Stable Match
  • Preference List
  • Current Partner
  • Stable Marriage

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Supported by the Spanish REPLI project TIC-2002-04470-C03-03.

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/11564751_14
  • Chapter length: 15 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
USD   149.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-32050-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   189.00
Price excludes VAT (USA)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Brito, I., Meseguer, P.: Distributed Forward Checking. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 801–806. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  2. Gale, D., Shapley, L.S.: College admissions and the stability of the marriage. American Mathematical Monthly 69, 9–15 (1962)

    MATH  CrossRef  MathSciNet  Google Scholar 

  3. Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discrete Applied Mathematics 11, 223–232 (1985)

    MATH  CrossRef  MathSciNet  Google Scholar 

  4. Gent, I.P., Irving, R.W., Manlove, D.F., Prosser, P., Smith, B.M.: A constraint programming approach to the stable marriage problem. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 225–239. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

  5. Gent, I., Prosser, P.: An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists. In: Proc. ECAI 2002, pp. 141–145 (2002)

    Google Scholar 

  6. Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. The MIT Press, Cambridge (1989)

    MATH  Google Scholar 

  7. Meisels, A., Kaplansky, E., Razgon, I., Zivan, R.: Comparing Performance of Distributed Constraint Processing Algorithms. In: AAMAS 2002 Workshop on Distributed Constraint Reasoning, pp. 86–93 (2002)

    Google Scholar 

  8. Lamport, L.: Time, Clock, and the Ordering of Events in a Distributed System. Communications of the ACM 21(7), 558–565 (1978)

    MATH  CrossRef  Google Scholar 

  9. Yokoo, M., Durfee, E., Ishida, T., Kuwabara, K.: The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Trans. Knowledge and Data Engineering 10, 673–685 (1998)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brito, I., Meseguer, P. (2005). Distributed Stable Matching Problems. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29238-8

  • Online ISBN: 978-3-540-32050-0

  • eBook Packages: Computer ScienceComputer Science (R0)