Revision as of 05:16, 7 May 2016 edit Garfield Garfield (talk \| contribs) Extended confirmed users 4,009 edits →Applications ← Previous edit		Revision as of 05:18, 7 May 2016 edit undo Garfield Garfield (talk \| contribs) Extended confirmed users 4,009 edits →Applications Next edit →
Line 2: ==Applications== The first application given is not an application of the stable marriage problem, since a hospital may hire more than one graduate at a time. For this the college admissions algorithm of Gale and Shapley is required. An important application of the stable marriage algorithm is matching organ donors to organ recipients. Many lives have been saved by using this algorithm, also devised by Gale and Shapley.<ref>''Mariages Stable'', Donald E Knuth.</ref><ref>Gale, D.; Shapley, L. S. (1962). "College Admissions and the Stability of Marriage". American Mathematical Monthly 69: 9–14. doi:10.2307/2312726. JSTOR 2312726.</ref> == Optimality of the solution ==

Talk:Stable matching problem: Difference between revisions