Stable marriage problem
MATHEMATICAL PROBLEM OF FINDING A STABLE MATCHING BETWEEN TWO EQUALLY SIZED SETS OF ELEMENTS GIVEN AN ORDERING OF PREFERENCES FOR EACH ELEMENT
Stable Marriage Problem; Stable matching; Stable marraige problem; Stable marriage; Stable matching problem
In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) 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.