Talk:Stable matching problem: Difference between revisions

Revision as of 05:19, 6 May 2022

Latest revision as of 12:47, 27 June 2025

(6 intermediate revisions by 4 users not shown)

Line 1:

{{VitalWikiProject articlebanner shell|class=C|levelvital=5yes|topic1=Mathematics}}

{{WikiProject Game theoryEconomics|classimportance=Cmid}}

{{WikiProject Game theory}}

}}

==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>