Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

18 relations
AlgorithmAssignment problemCC (complexity)Computer science

Broader (1)

Game theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Size Versus Stability in the Marriage Problem
Given an instance I of the classical Stable Marriage problem with Incomplete preference lists (smi), a maximum cardinality… 
Review
2008
Review
2008
A Survey of the Stable Marriage Problem and Its Variants
The stable marriage problem is to find a matching between men and women, considering preference lists in which each person… 
Highly Cited
1999
Highly Cited
1999
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications
This paper is motivated by a study of the mechanism used to assign primary school students in Singapore to secondary schools. The… 
Highly Cited
1996
Highly Cited
1996
Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms
Introduction, definitions, and examples Existence of a stable matching: the fundamental algorithm Principle of deferred decisions… 
Highly Cited
1995
Highly Cited
1995
On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games
Review
1994
Review
1994
The Value of the Voting Right: A Study of the Milan Stock Exchange Experience
I study the large premium (82 percent) attributed to voting shares on the Milan Stock Exchange. The premium varies according to… 
Highly Cited
1987
Highly Cited
1987
An efficient algorithm for the “optimal” stable marriage
In an instance of size n of the stable marriage problem, each of n men and n women ranks the members of the opposite sex in order… 
Highly Cited
1987
Highly Cited
1987
Three Fast Algorithms for Four Problems in Stable Marriage
  • D. Gusfield
  • SIAM journal on computing (Print)
  • 1987
  • Corpus ID: 14699208
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… 
Highly Cited
1986
Highly Cited
1986
The Complexity of Counting Stable Marriages
In an instance of size n of the stable marriage problem, each of n men and n women ranks the members of the opposite sex in order… 
Highly Cited
1971
Highly Cited
1971
The stable marriage problem
The original work of Gale and Shapley on an assignment method using the stable marriage criterion has been extended to find all… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)