Revision as of 19:06, 25 January 2022 edit 131.220.239.214 (talk) Clarification of definition of stable matching ← Previous edit		Revision as of 19:24, 25 January 2022 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,633 edits →Background: ce Next edit →
Line 12: }} In other words, a matching is stable when there is no ~~match~~pair (''A'', ''B'') where both participants prefer each other to their ~~current~~matched partners. ==Solution==

Gale–Shapley algorithm: Difference between revisions