Talk:Stable matching problem: Difference between revisions

Content deleted Content added
Cewbot (talk | contribs)
m Maintain {{Vital article}}: The article is listed in the level 5 page: undefined Configured as topic=Mathematics
Cewbot (talk | contribs)
m Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Merge {{VA}} into {{WPBS}}. Create {{WPBS}}. Keep majority rating "C" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{WikiProject Economics}}, {{WikiProject Game theory}}.
Line 1:
{{Vital article|class=C|level=5|topic=Mathematics}}
{{WikiProject Economics|class=C}}
{{WikiProject Game theory|class=C}}
 
{{WikiProject banner shell|class=C|vital=yes|1=
{{WikiProject Economics|class=C}}
{{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>