Sign In

Login

Password

Forgot Password ? Sign Up

National Resident Matching Program (German Wikipedia)

Analysis of information sources in references of the Wikipedia article "National Resident Matching Program" in German language version.

refsWebsite
Global rank German rank
9web.archive.org
1st place
1st place
5doi.org
2nd place
3rd place
4redirecter.toolforge.org
33rd place
2nd place
2nrmp.org
low place
low place
2r-project.org
7,871st place
7,186th place
1nobelprize.org
301st place
369th place
1stanford.edu
179th place
460th place
1mit.edu
415th place
779th place
1zdb-katalog.de
123rd place
6th place
1studentdoctor.net
low place
low place
1harvard.edu
18th place
181st place
1nytimes.com
7th place
19th place
1matchingtools.com
low place
low place

doi.org

  • Dan Gusfield: The Stable Marriage Problem: Structure and Algorithms. The MIT Press, 1989, ISBN 0-262-07118-5, 1.1.1, S. 3–4.
    Description of market based on A. E. Roth: The evolution of the labor market for medical interns and residents: a case study in game theory. In: Journal of Political Economy. 92. Jahrgang, 1984, S. 991–1016, doi:10.1086/261272.
  • Gusfield „Stable Marriage“ 64 references A.E. Roth: The evolution of the labor market for medical interns and residents: a case study in game theory. In: Journal of Political Economy. 92. Jahrgang, 1984, S. 991–1016, doi:10.1086/261272. as proving that the pre-1995 algorithm is essentially the hospital-optimal algorithm described in Gusfield 39. Gusfield 41 demonstrates that the hospital-optimal algorithm is also applicant-pessimal.
  • Alvin Roth, Elliott Peranson: The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design. In: The American Economic Review. 89. Jahrgang, Nr. 4, September 1999, S. 756–757, doi:10.1257/aer.89.4.748 (stanford.edu [PDF; abgerufen am 31. Januar 2018]).
  • Gusfield „Stable Marriage“ 54 gives an example of a situation with no stable solution and states that proof of NP completeness comes from Eytan Ronn: NP-complete stable matching problems. In: Journal of Algorithms. 11. Jahrgang, Nr. 2, Juni 1990, ISSN 0196-6774, S. 285–304, doi:10.1016/0196-6774(90)90007-2.
  • Alvin E. Roth, Elliott Peranson: The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design. In: The American Economic Review. 89. Jahrgang, Nr. 4, September 1999, S. 756–757, doi:10.1257/aer.89.4.748 (bepress.com (Memento des Originals vom 11. Juni 2011 im Internet Archive) [abgerufen am 31. Januar 2018]).

harvard.edu

isites.harvard.edu

matchingtools.com

mit.edu

tedlab.mit.edu

nobelprize.org

nrmp.org

nytimes.com

r-project.org

cran.at.r-project.org

redirecter.toolforge.org

  • Sara Robinson: Are Medical Students Meeting Their (Best Possible) Match? In: SIAM News. Nr. 3, April 2003, S. 36 (siam.org (Memento des Originals vom 18. November 2016 im Internet Archive) [abgerufen am 31. Januar 2018]).
  • Alvin E. Roth, Elliott Peranson: The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design. In: The American Economic Review. 89. Jahrgang, Nr. 4, September 1999, S. 756–757, doi:10.1257/aer.89.4.748 (bepress.com (Memento des Originals vom 11. Juni 2011 im Internet Archive) [abgerufen am 31. Januar 2018]).
  • The Residency Scramble: How It Works and How It Can Be Improved. Studentdoctor.net, 12. März 2009, archiviert vom Original am 18. August 2013; abgerufen am 31. Januar 2018.
  • Frequently Asked Questions – U.S. Seniors. Archiviert vom Original am 2. Dezember 2011; abgerufen am 31. Januar 2018 (englisch).

stanford.edu

web.stanford.edu

  • Alvin Roth, Elliott Peranson: The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design. In: The American Economic Review. 89. Jahrgang, Nr. 4, September 1999, S. 756–757, doi:10.1257/aer.89.4.748 (stanford.edu [PDF; abgerufen am 31. Januar 2018]).

studentdoctor.net

web.archive.org

zdb-katalog.de

  • Gusfield „Stable Marriage“ 54 gives an example of a situation with no stable solution and states that proof of NP completeness comes from Eytan Ronn: NP-complete stable matching problems. In: Journal of Algorithms. 11. Jahrgang, Nr. 2, Juni 1990, ISSN 0196-6774, S. 285–304, doi:10.1016/0196-6774(90)90007-2.