Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Stable marriage problem

Known as: Stable matching problem, Stable matching, Marriage problem 
In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) is the problem of finding a stable… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Many centralized two-sided markets form a matching between participants by running a stable marriage algorithm. It is a well… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The Stable Marriage Problem and its many variants have been widely studied in the literature (Gusfield and Irving, The Stable… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
“The Stable marriage problem (SMP) is basically the problem of finding a stable matching between two sets of persons, the men and… Expand
  • table 2.2
  • table 2.4
  • table 2.5
  • table 3.2
  • table 3.3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
It is well known that every instance of the classical stable marriage problem admits at least one stable matching, and that such… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
 
Is this relevant?
Highly Cited
1989
Highly Cited
1989
This book probes the stable marriage problem and its variants as a rich source of problems and ideas that illustrate both the… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The stable marriage problem is a well-known problem of matching n men to n women to achieve a certain type of “stability;” the $O… Expand
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The stable marriage problem is that of matching n men and n women, each of whom has ranked the members of the opposite sex in… Expand
  • table 1
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Abstract The stable matching problem is that of matching two sets of agents in such a manner that no two unmatched agents prefer… Expand
Is this relevant?
Highly Cited
1971
Highly Cited
1971
The original work of Gale and Shapley on an assignment method using the stable marriage criterion has been extended to find all… Expand
Is this relevant?