Pairing where no unchosen pair prefers each other over their choice
In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem) is the problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences for each element. A matching is a bijection from the elements of one set to the elements of the other set. A matching is not stable if:
There is an element A of the first matched set which prefers some given element B of the second matched set over the element to which A is already matched, and
B also prefers A over the element to which B is already matched.
In other words, a matching is stable when there does not exist any pair (A, B) which both prefer each other to their current partner under the matching.
The stable marriage problem has been stated as follows:
Given n men and n women, where each person has ranked all members of the opposite sex in order of preference, marry the men and women together such that there are no two people of opposite sex who would both rather have each other than their current partners. When there are no such pairs of people, the set of marriages is deemed stable.
The existence of two classes that need to be paired with each other (heterosexual men and women in this example) distinguishes this problem from the stable roommates problem.
and 23 Related for: Stable marriage problem information
economics, and computer science, the stablemarriageproblem (also stable matching problem) is the problem of finding a stable matching between two equally sized...
sultan's dowry or best choice problem, in optimal stopping theory Stablemarriageproblem, the problem of finding a stable matching between two equally...
under the matching. This is distinct from the stable-marriageproblem in that the stable-roommates problem allows matches between any two elements, not...
millionaire problem in cryptography Sorbitan monopalmitate, a food additive SOTA Mapping Project, a website for radio amateurs Stablemarriageproblem in mathematics...
in life. The stablemarriageproblem, and human matching more generally, is a problem of allocation. Unlike marketplaces, where problems are solved by...
matchmaking Collaborative filtering Mail-order bride Marriage market Matrimonial website Stablemarriageproblem The old man under the moon: fabled Chinese matchmaker...
assignment problem Rank-maximal matching Secretary problemStablemarriageproblemStable roommates problem Weapon target assignment problem House allocation...
also known as the marriageproblem, the sultan's dowry problem, the fussy suitor problem, the googol game, and the best choice problem. Its solution is...
perfect matching in a bipartite graph The stablemarriage theorem, stating that every stablemarriageproblem has a solution This disambiguation page lists...
literature emerged from the Gale and Shapley (1962) introduction of the stablemarriageproblem. The second category is matching with transferable utility (TU)...
minimal. Matching applicants to programs is a generalization of the stablemarriageproblem; as a result, the solutions are very similar. A simplified version...
weighted or block voting power), the Gale–Shapley algorithm for the stablemarriageproblem, the concept of a potential game (with Dov Monderer), the Aumann–Shapley...
algorithm Closure problem Generalized assignment problem Linear bottleneck assignment problem Quadratic assignment problemStablemarriageproblem Andersen, A...
1962 paper with Lloyd Shapley on the stablemarriageproblem provides the first formal statement and proof of a problem that has far-reaching implications...
in function value iterations Gale–Shapley algorithm: solves the stablemarriageproblem Pseudorandom number generators (uniformly distributed—see also...
lattice of stable matchings is a distributive lattice whose elements are stable matchings. For a given instance of the stable matching problem, this lattice...
Archived from the original on 2018-07-15. Retrieved 2018-03-08. "StableMarriageProblem – Numberphile". YouTube. 2014-09-04. Retrieved 2018-03-08. "Fat...
the stable matching polytope or stablemarriage polytope is a convex polytope derived from the solutions to an instance of the stable matching problem. The...
Persiaran Brash Shin Megami Tensei Stationary-moving target indication Stablemarriageproblem with ties and indifference This disambiguation page lists articles...
theory of stable allocations and the practice of market design" Stanford University Stanford University Harvard University Stablemarriageproblem, Repugnancy...
Global Information