Stable matching problem

Uncommon card · No. 171622

In mathematics, economics, and computer science, the 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: In other words, a matching is stable when there does not exist any pair (A, B) where both prefer each other to their current partner under the matching. The problem has been stated as a stable marriage problem: 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 to each other 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...

Read on Wikipedia