Revision as of 05:09, 7 May 2016 edit Garfield Garfield (talk \| contribs) Extended confirmed users 4,009 edits →Optimality of the solution ← Previous edit		Revision as of 05:10, 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 medical ~~student~~school will hire more than one student. An important application is mapping organ donors to organ recipients. Many lives have been saved by using the algorithm devised by Gale and Shapley.<ref>''Mariages Stable'', Donald E Knuth.</ref> == Optimality of the solution ==

Talk:Stable matching problem: Difference between revisions