안정적인 결혼 문제

노트

Such a graph is called an instance of the stable marriage problem with strict preferences and incomplete lists.^[1]
This book probes the stable marriage problem and its variants as a rich source of problems and ideas that illustrate both the design and analysis of efficient algorithms.^[2]
The relationship between the structure of the stable marriage problem and the more general stable roommates problem is demonstrated, revealing many commonalities.^[2]
The Stable Marriage Problem is included in the Foundations of Computing Series, edited by Michael Garey and Albert Meyer.^[2]
This article considers a generalized form of the stable marriage problem, where different numbers of men and women need to be matched pairwise and the emergence of single men or women is inevitable.^[3]
The stable marriage problem (SMP) consists in matching men and women by pairs.^[3]
Here, in this paper, we extend the stable marriage problem to a generalized stable marriage problem (GSMP), which represents a matching between any given sizes of the two sides.^[3]
The stable marriage problem of the equal size of the two sides has been thoroughly studied by many previous researches.^[3]
From this article, you will learn about stable pairing or stable marriage problem.^[4]
In an instance of the stable marriage problem of size n, n men and n women, each participant ranks members of the opposite sex in order of preference.^[5]
Gale-Shapley provides a solution to the stable marriage problem.^[6]