Revision as of 12:42, 20 December 2019 edit Frap (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 35,588 edits →Algorithm: MOS:ALGO ← Previous edit		Revision as of 17:01, 11 February 2020 edit undo Will Sandberg (talk \| contribs) Extended confirmed users 8,834 edits mNo edit summary Next edit →
Line 4: ==Background== {{main\|stable matching problem}} The stable matching problem, in its most basic form, takes as input equal numbers of two types of participants ({{mvar\|n}} men and {{mvar\|n}} women, or {{mvar\|n}} medical students and {{mvar\|n}} internships, for example), and an ordering for each participant giving their preference for ~~who~~whom to be matched to among the participants of the other type. A matching is ''not'' stable if: {{Ordered list\|list-style-type=numeric

Gale–Shapley algorithm: Difference between revisions