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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
To cope with the explosive vehicular content demands from various applications and services, it is imperative to cache the… 
2008
2008
In this paper we present a model of peer-to-peer backup and storage systems in which users have the ability to selfishly select… 
2007
2007
This paper introduces ant colony system (ACS), a distributed algorithm that is applied to the Stable Marriage Problem (SM). The… 
2007
2007
In this paper we provide a comparison, both analytic and empirical, of two algorithms that were used in the literature for… 
2006
2006
Interstitial waters from four sites of the Japan Sea (794 to 797) have been analyzed for stable isotopes (δ D, δ n B , δ 1 8… 
2005
2005
We study the Stable Marriage problem (SM), which is a combinatorial problem that arises in many practical applications. We… 
2001
2001
  • 2001
  • Corpus ID: 10180337
In this paper we explore stability principle applied to the problem of stereoscopic matching. Stability is based on competition… 
2000
2000
Given a set of n men and n women, marry them off in pairs after each man has ranked the women in order of preference from 1 to n… 
1996
1996
In order to realize robust speech understanding, we present a phrase spotting approach. The use of concept-based phrases as the… 
1995
1995
In this paper we consider a sex-fair matching in the stable marriage problem. The sex-fair stable matching defined in this paper…