Talk:Stable matching problem: Difference between revisions

Content deleted Content added

Revision as of 08:20, 17 November 2023 edit Cewbot (talk \| contribs) Bots 8,374,033 edits m Maintain {{Vital article}}: The article is listed in the level 5 page: undefined Configured as topic=Mathematics ← Previous edit		Latest revision as of 12:47, 27 June 2025 edit undo Pragmatic Puffin (talk \| contribs) Extended confirmed users 3,317 edits m Add assessment for importance
(3 intermediate revisions by 2 users not shown)
Line 1: {{~~Vital~~WikiProject ~~article~~banner shell\|class=C\|~~level~~vital=5yes\|~~topic~~1=~~Mathematics}}~~ {{WikiProject Economics\|~~class~~importance=Cmid}} {{WikiProject Game theory~~\|class=C~~}} }} ==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>