Stable matching problem: Difference between revisions

Content deleted Content added
GreenC bot (talk | contribs)
Rescued 1 archive link. Wayback Medic 2.5
wording was confusing. changed match to pair, as the pair (A,B) as they are not yet matched.
Line 7:
}}
 
In other words, a matching is stable when there does not exist any matchpair (''A'', ''B'') which both prefer each other to their current partner under the matching.
 
The stable marriage problem has been stated as follows: