A network visualization of stable matching in the stable marriage problem

Authors:
Yoshihisa Morizumi;Tatsuya Hayashi;Yoshiteru Ishida
Affiliations:
Department of Knowledge-Based Information Engineering, Toyohashi University of Technology, Tempaku, Toyohashi, Aichi, Japan 441-8580;Department of Knowledge-Based Information Engineering, Toyohashi University of Technology, Tempaku, Toyohashi, Aichi, Japan 441-8580;Department of Knowledge-Based Information Engineering, Toyohashi University of Technology, Tempaku, Toyohashi, Aichi, Japan 441-8580
Venue:
Artificial Life and Robotics
Year:
2011

Citing 5
Cited 1

The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
Transformation from arbitrary matchings to stable matchings

Journal of Combinatorial Theory Series A
How do I marry thee? Let me count the ways

Discrete Applied Mathematics
Of Stable Marriages and Graphs, and Strategy and Polytopes

SIAM Review
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs

Mapping problems to dynamical systems for robustness and adaptability: the case of matching problems

Proceedings of the International Conference on Management of Emergent Digital EcoSystems

Quantified Score

Hi-index	0.00

Visualization

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.