Stable marriage problem

Known as: Stable matching, Gale-Shapley pairing, Stable matching problem 
In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) is the problem of finding a stable… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1971-2017
05019712017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
We first consider the problem of finding a maximum size stable matching if incomplete lists and ties are both allowed, but ties… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
The Gale-Shapley “propose/reject” algorithm is a wellknown procedure for solving the classical stable marriage problem. In this… (More)
Is this relevant?
2005
2005
The Stable Marriage Problem is a combinatorial problem which can be solved by a centralized algorithm in polynomial time. This… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
2005
2005
In this paper we consider instances of stable matching problems, namely the classical Stable Marriage (SM) and Stable Roommates… (More)
Is this relevant?
2003
2003
A stable matching is a complete matching of men and women such that no man and woman who are not partners both prefer each other… (More)
Is this relevant?
2003
2003
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper is motivated by a study of the mechanism used to assign primary school students in Singapore to secondary schools. The… (More)
  • figure 1
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Where you can find the the stable marriage problem structure and algorithms easily? Is it in the book store? On-line book store… (More)
Is this relevant?
1989
1989
We study a variant of the classical stable marriage problem in which there is an additional requirement for a stable matching… (More)
  • figure 4
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… (More)
  • table I
  • figure 1
Is this relevant?