Content deleted Content added
Srich32977 (talk | contribs) mNo edit summary Tags: Mobile edit Mobile app edit iOS app edit |
Pairing where no unchosen pair prefers each other over their choice |
||
Line 1:
{{Short description|
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 (graph theory)|matching]] is a [[bijection]] from the elements of one set to the elements of the other set. A matching is ''not'' stable if:
| |||