Skip to main content

Advertisement

Springer Nature Link
Log in

A network visualization of stable matching in the stable marriage problem

  • Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

Abstract

The stable marriage problem (SMP) seeks matchings between n women and n men which would result in stability, and not lead to divorce or extramarital affairs. We have introduced a network consisting of nodes which represent matchings, and links between nodes which attain stability by exchanging a partner between two pairs. The network is depicted with nodes laid out to involve several coordinates which indicate either women’s satisfaction or men’s or both. With the network visualization, regularity and symmetry can be made conspicuous in specific instances of the SMP such as the Latin SMP.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Gusfield D, Irving RW (1989) The stable marriage problem: structure and algorithm. MIT Press, London

    MATH  Google Scholar 

  3. Knuth DE (1997) Stable marriage and its relation to other combinatorial problems. An introduction to the mathematical analysis of algorithms. CRM Proceedings and Lecture Notes, vol 10

  4. Tamura A (1993) Transformation from arbitrary matchings to stable matchings. J Combinatorial Theor Ser A 62:310–323

    Article  MATH  Google Scholar 

  5. Battista GD, Eades P, Tamassia R, et al (1998) Graph drawing: algorithms for the visualization of graphs Prentice Hall, Englewood Cliffs

    Google Scholar 

  6. Balinski M, Ratier G (1997) Of stable marriages and graphs, and strategy and polytopes. SIAM Rev 39:575–604

    Article  MATH  MathSciNet  Google Scholar 

  7. Benjamin AT, Converse C, Krieger HA (1995) How do I marry thee? Let me count the ways. Discrete Appl Math

Download references

Author information

Authors and Affiliations

  1. Department of Knowledge-Based Information Engineering, Toyohashi University of Technology, Tempaku, Toyohashi, Aichi, 441-8580, Japan

    Yoshihisa Morizumi, Tatsuya Hayashi & Yoshiteru Ishida

Authors
  1. Yoshihisa Morizumi
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Tatsuya Hayashi
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Yoshiteru Ishida
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Yoshiteru Ishida.

Additional information

This work was presented in part at the 15th International Symposium on Artificial Life and Robotics, Oita, Japan, February 4–6, 2010

About this article

Cite this article

Morizumi, Y., Hayashi, T. & Ishida, Y. A network visualization of stable matching in the stable marriage problem. Artif Life Robotics 16, 40–43 (2011). https://doi.org/10.1007/s10015-011-0873-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-011-0873-4

Key words