Skip to main content
SpringerLink
Log in

On the complexity of distributed stable matching with small messages

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

We consider the distributed complexity of the stable matching problem (a.k.a. “stable marriage”). In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Given a matching of the nodes, a pair of unmatched nodes is called blocking if they prefer each other to their assigned match. A matching is called stable if it does not induce any blocking pair. In the distributed model, nodes exchange messages in each round over the communication links, until they find a stable matching. We show that if messages may contain at most B bits each, then any distributed algorithm that solves the stable matching problem requires \({\Omega(\sqrt{n/B\log n})}\) communication rounds in the worst case, even for graphs of diameter O(log n), where n is the number of nodes in the graph. Furthermore, the lower bound holds even if we allow the output to contain \({O(\sqrt n)}\) blocking pairs, and if a pair is considered blocking only if they like each other much more then their assigned match.

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. Awerbuch B.: Complexity of network synchronization. J. ACM. 32(4), 804–823 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chuang S.-T., Goel A., McKeown N., Prabhakar B.: Matching output queueing with a combined input output queued switch. IEEE J. Sel. Areas Commun. 17(6), 1030–1039 (1999)

    Article  Google Scholar 

  3. Elkin M.: An unconditional lower bound on the time-approximation tradeoff for the minimum spanning tree problem. SIAM J. Comput. 36(2), 463–501 (2006)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  6. Halldórsson, M.M., Irving, R., Iwama, K., Manlove, D. (eds.): MATCH-UP: Matching Under Preferences Reykjavk, Iceland, March 2008. In: Satellite workshop of ICALP 2008. http://www.dcs.gla.ac.uk/research/algorithms/workshop/ (2008)

  7. Halldórsson, M.M., Iwama, K., Miyazaki, S., Morita, Y.: Inapproximability results on stable marriage problems. In: LATIN ’02: Proc. 5th Latin American Symp. on Theoretical Informatics, pp. 554–568. Springer, London, UK (2002)

  8. Irving, R.W.: Man-exchange stable marriage. University of Glasgow, Computing Science Department Research Report TR-2004-177 (2004)

  9. Irving, R.W., Manlove, D.F., Scott, S.: The hospitals/residents problem with ties. In: Proc. SWAT 2000 LNCS 1851, pp. 259–271(2000)

  10. Iwama, K., Miyazaki, S.: A survey of the stable marriage problem and its variants. Informatics Education and Research for Knowledge-Circulating Society, 2008. ICKS 2008. In: International Conference on, pp. 131–136 (2008)

  11. Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: Proc. 17th Ann. ACM-SIAM Symposium on Discrete Algorithms, pp. 980–989. ACM, New York, NY, USA (2006)

  12. Kujansuu E., Lindberg T., Mäkinen E.: The stable roommates problem and chess tournament pairings. Divulgaciones Matemáticas 7(1), 19–28 (1999)

    MATH  Google Scholar 

  13. Lotker Z., Patt-Shamir B., Peleg D.: Distributed MST for constant diameter graphs. Distrib. Comput. 18(6), 453–460 (2006)

    Article  Google Scholar 

  14. Lotker, Z., Patt-Shamir, B., Pettie, B.: Improved distributed approximate matching. In: Proc. ACM Symposium on Parallellism in Algorithms and Architecture, pp. 129–136. ACM, New York, NY, USA (2008)

  15. Peleg D.: Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2000)

    MATH  Google Scholar 

  16. Peleg D., Rubinovich V.: Near-tight lower bound on the time complexity of distributed MST construction. SIAM J. Comput. 30, 1427–1442 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering, Tel Aviv University, 69978, Tel Aviv, Israel

    Alex Kipnis & Boaz Patt-Shamir

Authors
  1. Alex Kipnis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Boaz Patt-Shamir
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Boaz Patt-Shamir.

Additional information

A preliminary version of this paper appeared in Proc. 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009).

Boaz Patt-Shamir: Supported in part by the Israel Science Foundation (Grant 664/05).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kipnis, A., Patt-Shamir, B. On the complexity of distributed stable matching with small messages. Distrib. Comput. 23, 151–161 (2010). https://doi.org/10.1007/s00446-010-0105-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-010-0105-5

Keywords

Search

Navigation