Content deleted Content added
ExpertIdeasBot-changing |
|||
Line 101:
*[http://cran.r-project.org/web/packages/matchingMarkets/ Gale-Shapley Algorithm in R package matchingMarkets]
[[User:Mtching|Mtching]] ([[User talk:Mtching|talk]]) 19:40, 10 December 2014 (UTC)
== Dr. Klijn's comment on this article ==
Dr. Klijn has reviewed [https://en.wikipedia.org/w/index.php?title=Stable_marriage_problem&oldid=720801008 this Wikipedia page], and provided us with the following comments to improve its quality:
{{quote|text=The largest (!) part of the article is about the case of stable marriage with indifference(S?). Even though the case of indifferences is studied in the literature, the three notions of stability and their algorithms receive too much attention. Probably it is more interesting to say more about the lattice structure of the set of stable matchings (i.e., extend the section "optimality of the solution") and discuss incentives / strategic aspects of the gale-shapley algorithm (also known as the deferred acceptance algorithm!). I think it would also of interest to mention that variants of the gale-shapley algorithm are actually used in real-life applications. For instance, medical interns in the US, or school choice in Boston and New York.}}
We hope Wikipedians on this talk page can take advantage of these comments and improve the quality of the article accordingly.
Dr. Klijn has published scholarly research which seems to be relevant to this Wikipedia article:
*'''Reference ''': Peter Biro & Flip Klijn, 2011. "Matching with Couples: a Multidisciplinary Survey," IEHAS Discussion Papers 1139, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences.
[[User:ExpertIdeasBot|ExpertIdeasBot]] ([[User talk:ExpertIdeasBot|talk]]) 12:51, 7 June 2016 (UTC)
| |||