Stable marriage problem
From The Art and Popular Culture Encyclopedia
Related e |
Google
Featured: |
In mathematics, the stable marriage problem (SMP) is the problem of finding a stable matching — a matching in which no element of the first matched set prefers an element of the second matched set that also prefers the first element.
It is commonly stated as:
- Given n men and n women, where each person has ranked all members of the opposite sex with a unique number between 1 and n in order of preference, marry the men and women off such that there are no two people of opposite sex who would both rather have each other than their current partners. If there are no such people, all the marriages are "stable".
[edit]
See also
- Assignment problem
- Stable roommates problem a similar problem, but with one set of size n and n-1 preferences
Unless indicated otherwise, the text in this article is either based on Wikipedia article "Stable marriage problem" or another language Wikipedia page thereof used under the terms of the GNU Free Documentation License; or on original research by Jahsonic and friends. See Art and Popular Culture's copyright notice.