Revision as of 04:57, 26 November 2019 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,640 edits belongs in lead ← Previous edit		Revision as of 04:58, 26 November 2019 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,640 edits see also Deferred-acceptance auction Next edit →
Line 91: [[Python (programming language)\|Python]]: The Gale–Shapley algorithm is included along with several others for generalized matching problems in the <code>QuantEcon/MatchingMarkets.py</code> package<ref>{{cite web\|url=https://github.com/QuantEcon/MatchingMarkets.py\|title=matchingMarkets.py\|date=\|work=Python package}}</ref> [[MATLAB]]: The Gale–Shapley algorithm is implemented in the <code>assign2DStable</code> function that is part of the [[United States Naval Research Laboratory \|United States Naval Research Laboratory's]] free Tracker Component Library.<ref>{{cite web\|url=https://github.com/USNavalResearchLaboratory/TrackerComponentLibrary\|title=Tracker Component Library\|work=Matlab Repository\|access-date=January 5, 2019}}</ref> ==See also== *[[Deferred-acceptance auction]] ==References==

Gale–Shapley algorithm: Difference between revisions