Revision as of 19:50, 15 January 2024 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,633 edits →Strategic considerations: spell it out ← Previous edit		Revision as of 19:51, 15 January 2024 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,633 edits →Applications: applications are mentioned earlier as part of other sections and I don't think this one is significant compared to the ones that are already mentioned Next edit →
Line 65: ==Recognition== Shapley and Roth were awarded 2012 [[Nobel Memorial Prize in Economic Sciences]] "for the theory of stable allocations and the practice of [[market design]]". Gale had died in 2008, making him ineligible for the prize.{{r\|nobel}} ~~== Applications ==~~ The Gale-Shapley algorithm is used in many assignment problems. For example, it is used to assign rabbis who graduate from [[Hebrew Union College – Jewish Institute of Religion\|Hebrew Union College]] to Jewish congregations.<ref>{{Cite journal \|last=Bodin \|first=Lawrence \|last2=Panken \|first2=Aaron \|date=2003-06 \|title=High Tech for a Higher Authority: The Placement of Graduating Rabbis from Hebrew Union College—Jewish Institute of Religion \|url=https://pubsonline.informs.org/doi/10.1287/inte.33.3.1.16013 \|journal=Interfaces \|language=en \|volume=33 \|issue=3 \|pages=1–11 \|doi=10.1287/inte.33.3.1.16013 \|issn=0092-2102}}</ref> ==See also==

Gale–Shapley algorithm: Difference between revisions