Wikipedia

National Resident Matching Program

(Redirected from NRMP)

The National Resident Matching Program (NRMP), also called The Match,[1] is a United States–based private non-profit non-governmental organization created in 1952 to place U.S. medical school students into residency training programs located in United States teaching hospitals. Its mission has since expanded to include the placement of U.S. citizen and non-U.S. citizen international medical school students and graduates into residency and fellowship training programs. In addition to the annual Main Residency Match that in 2021 encompassed more than 48,000 applicants and 38,000 positions,[2] the NRMP conducts Fellowship Matches for more than 60 subspecialties through its Specialties Matching Service (SMS). The NRMP is sponsored by a board of directors that includes medical school deans, teaching hospital executives, graduate medical education program directors, medical students and residents, and one public member.

NRMP International, a subsidiary of the National Resident Matching Program, was established in 2010 to provide medical matching services outside the United States and Canada.

History

edit

From shortly after the first residency programs were formally introduced in the 1920s, the hiring process was "characterized by intense competition among hospitals for (an inadequate supply) of interns."[3] In general, hospitals benefited from filling their positions as early as possible, and applicants benefited from delaying acceptance of positions. The combination of those factors led to offers being made for positions up to two years in advance of the start of postgraduate training.[4]

In 1945, medical schools decided not to release any transcripts or permit any letters of recommendation to be written until a particular date. In that way, they managed to move the date of residency selection back to the fourth year of medical school. However, the competition for residents simply took on another form. Programs began to issue offers with a time limit for reply. The time limit rapidly decreased from 10 days in 1945 to less than 12 hours in 1950. Students were being issued "exploding" offers that required them to make a decision about training before hanging up the telephone.[5]

In the early 1950s, the National Interassociation Committee on Internships (NICI) examined existing matching plans and chose the Boston Pool Plan, utilized at the time by Boston-area programs, as the model for a trial run of a new centralized system. In October 1951, student representatives from 79 medical schools formed the National Student Internship Committee (NSIC) to discuss the findings of the NICI trial Match and consider an NICI proposal to replicate the Boston Pool Plan at the national level. NSIC petitioned to have the algorithm modified to more equitably represent applicants, and the modified algorithm was adopted and used for the first Match on 1952.[6] That Match was a success, and the NICI recommended the creation of an organization to administer and oversee the running of the Match. The organization, known as the National Intern Matching Program (NIMP), was established in 1952 at the request of medical students.[7]

Modifications to the algorithm proposed by students in 1951 were based on concerns that the matching process favored hospitals over applicants.[8][9][10] The students believed the algorithm gave them incentives to misrepresent their true preferences.[11] A publication in 1962 by David Gale & Lloyd Shapley noted that there always exists a stable solution when colleges are matching with students, but that it is possible to favor colleges as a group over applicants as a group (and vice versa).[12] That is, Gale and Shapley found that there is a college-optimal stable match and an applicant-optimal stable match.[12] Lloyd Shapley along with Alvin Roth, would go on to win the 2012 Nobel Prize in Economics for their work on stable allocations.[4]

A debate arose regarding whether the matching program was susceptible to manipulation or unreasonably fair to programs.[13] Indeed, it was shown that in simple cases (i.e. those that exclude couples, second-year programs, and special cases for handling unfilled slots) that had multiple "stable" matchings, the algorithm would return the solution that preferred the preferences of programs over applicants.[14][15] A correspondence in New England Journal of Medicine in 1981 recognized that the algorithm in use was program-optimal for individual applicants.[16]

Later researchers, such as Marilda Sotomayor in 1983, Alvin Roth in 1984, and Klaus et al. in 2007, found that when couples are allowed to match together, there may exist no stable matching.[17][18] However, Fuhito Kojima and Parag Pathak in 2009 demonstrated that if the market is large and the fraction of couples is small, then a stable matching exists with high probability.

The NRMP algorithm saw only minor and incremental changes after its institution in 1952.[3][19] However, in the fall of 1995 the NRMP Board of Directors commissioned a preliminary research study to evaluate the current algorithm and recommend changes to be considered in its operation and description,[20] as well as a study comparing a new algorithm with the existing one.[19] A new applicant-proposing algorithm was adopted in May 1997 and has been in use since its first application in March 1998,[19] although the study showed that the net effect of the change on actual matches has been minimal.[21]

Matching algorithm

edit

Matching applicants to programs is a generalization of the stable marriage problem; as a result, the solutions are very similar. A simplified version of the algorithm that is used to perform the matching process is described below and on the NRMP website. However, this description does not include the handling of couples (pairs of applicants who participate in a Match together, perhaps to stay in the same geographic location), second-year positions, or special handling of residency positions that remain unfilled. The full algorithm is described in Roth & Peranson 1999.

Inputs

edit

The application process for residency training begins prior to the opening of the Main Residency Match in September. Applications usually are sent to programs through the Electronic Residency Application Service (ERAS), a service of the Association of American Medical Colleges. After applicants apply to programs, programs review applications and invite selected candidates for interviews held between October and February. After the interview period is over, programs and applicants each compile "rank order lists" that they submit to the NRMP. Programs list applicants, ranked in order from most to least preferred, whom they wish to train. Similarly, applicants rank programs where they wish to train. For applicants matching as a couple, the rank order lists include pairs of program choices that are considered simultaneously by the matching algorithm. Applicants' rank order lists can include a combination of categorical programs (training that is 3–5 years in length and begins in the first post-graduate year); preliminary programs (training that is one year in length and begins in the first post-graduate year); or advanced programs (training that is 3–4 years in length and begins after one or more years of preliminary training). For advanced programs on the rank order list, applicants can append a supplemental list of preliminary programs to attempt to match to a full course of training.

Simple case

edit

The matching process begins with an attempt to match an applicant to the program most preferred on that applicant's rank order list (ROL). If the applicant cannot be matched to that first choice program, an attempt is made to place the applicant into the second choice program, and so on, until the applicant is tentatively matched to a program that has an open position and who prefers that applicant or all the applicant's choices on the ROL have been exhausted. This process is carried out for all applicants until each applicant has either been tentatively matched to the most preferred choice possible or all choices submitted by all applicants have been exhausted. Tentative matches then become final.

To understand how the current NRMP algorithm works, it is helpful to begin by considering the simpler case where there are no couples or secondary programs.

As in the stable marriage problem, the basic goal is to match applicants to programs so that the results are "stable". "Stability" in this case means that there is no applicant A and program P such that both of the following are true:

  • A is unmatched or would prefer to go to P over the program to which A matched
  • P has a free slot or would prefer A over one of the other applicants matched to the program.[22]

It can be shown that for any instance of the problem, there is at least one valid solution.[23] Under the old (pre-1995) NRMP algorithm that favored programs' preferences over applicants', programs could benefit in certain cases from lying about their preferences. This is no longer possible under the current algorithm. Applicants cannot benefit by lying about their preferences, even if they have perfect knowledge of everyone's preferences.[24]

Under the current system, it also is impossible for an applicant to be harmed by including more residency programs at the bottom of a list if those programs are indeed preferable to not being matched.[25]

Couples

edit

Couples' rank order lists are processed simultaneously by the matching algorithm, which complicates the problem. In some cases there exists no stable solution (with stable defined the way it is in the simple case). In fact, the problem of determining whether there is a stable solution and finding it if it exists has been proven NP-complete.[27] Also, while there is no randomization in the NRMP algorithm—so it will always return the same output when given exactly the same input[28]—different outcomes can be produced by changing trivial features of the data such as the order in which applicants and programs are processed. However, in initial testing of the algorithm over 5 years of residency match data and a variety of different initial conditions, the current NRMP algorithm always terminated quickly on a stable solution.[29] Testing also showed that "none of [the trivial] sequencing decisions had a large or systematic effect on the matching produced"—the maximum number of applicants ever observed to be affected in a single run was 12 out of 22,938.[30]

In general once the programs' rank order lists have been set, there is no way for an applicant to match into a better position by deciding to match as part of a couple. For example, if a very strong applicant and a very weak applicant match as a couple, there is no mechanism in the algorithm that allows the stronger applicant to somehow improve the desirability of the weaker applicant.[31] (Of course, if the programs know prior to processing the matching algorithm that the stronger and weaker applicant are participating in the Match as a couple, they are free to change their lists accordingly, which could affect the outcome.)

Failure to match

edit

It is possible for an applicant not to match to a program. Until the 2010 Main Residency Match, applicants who did not obtain a position went through a process called the Scramble.[32] At 12:00 p.m. on Monday of Match Week, the NRMP notified applicants whether they had matched to a program (but did not release the name of the program) and released a list of unfilled programs. Applicants then applied en masse to programs that had unfilled positions, frequently having to change their preferred specialty in the process. The Scramble was widely recognized to be chaotic, disorganized, and lacking in transparency. The Scramble ended on Match Day, which was Thursday of Match Week. Most positions filled within the first few hours, and nearly all in the first 48 hours.[32][33] Scrambling was extremely competitive: in 2008, roughly 10,600 applicants, many of whom were foreign-trained, scrambled for only 1,392 residency positions.[34]

After the 2010 Main Residency Match, the Scramble was replaced by the Supplemental Offer and Acceptance Program, or SOAP.[32] In SOAP, unmatched applicants are offered positions in unfilled programs through a series of rounds, creating a systematic way for applicants to find training positions without the chaos of the Scramble.[35] In SOAP, all appointments are made through the NRMP (no direct matching allowed, unlike the Scramble), and unmatched applicant data and unfilled program data are released at the same time on Monday of Match Week.[33] Match Day is now Friday of Match Week.

Results

edit

Of the 35,476 total active applicants who participated in The National Resident Matching Program in 2016, 75.6% (26,836) were able to find PGY-1 (R-1) matches. Out of the total active applicants, 51.27% (18,187) were graduates of conventional US medical schools; 93.8% (17,057) were able to find a match. In comparison, match rates were 80.3% of osteopathic graduates, 53.9% of US citizen international medical school graduates, and 50.5% of non-US citizen international medical schools graduates.[36]

In 2021, there were a total of 48,700 registered applicants. A total of 38,106 positions were offered in the match. 94.9% of them were filled. 92.8% U.S. MD seniors matched to PGY1 positions, while the percentage for U.S. DO seniors was 89.1%. [37]

International medical graduates

edit

To participate in the NRMP, an international medical graduate must have ECFMG ID. USMLE ID is not required for IMGs, but it can be entered. It is the same as the ECFMG ID.[38] IMGs must not be completely ECFMG certified but many programs require USMLE Step 2 before "Rank Order List Submission Deadline".[39]

In comparison, students and graduates from medical schools in the United States are bound to the graduation requirements of their individual schools. Both U.S. and foreign-trained applicants can participate in the NRMP while completing their final year of medical school before acquiring their medical diplomas.

Lawsuit

edit
Main article: Jung v. Association of American Medical Colleges

In 2002, 16 law firms filed a lawsuit on behalf of three residents seeking to represent all residents matching through the NRMP. The plaintiffs put forward a case which sought to show that the NRMP colluded with other national medical and medical education organizations and with residency-sponsoring institutions to depress resident wages, operating in violation of United States antitrust legislation.[40]

In 2004, after a lobbying effort by the Association of American Medical Colleges and the American Hospital Association, a rider that granted specific immunity to the NRMP was added to a pension act signed into law by President George W. Bush. The provision was sponsored by Senators Edward M. Kennedy, Democrat of Massachusetts, and Judd Gregg, Republican of New Hampshire. Subsequently, a federal district court dismissed the case.[41]

Implementations in software packages

edit
  • Python: A variant of the Roth-Peranson algorithm, as presented in Roth (1984), is available as part of the matching library.[42]
  • R: The Roth-Peranson algorithm used in the NRMP is available as part of the matchingMarkets[43][44] package.
  • API: The MatchingTools API provides a free application programming interface for the Roth-Peranson algorithm used in the NRMP.[45]

See also

edit

References

edit
  1. ^ NRMP homepage Retrieved on June 16, 2017
  2. ^ "Match by the Numbers" (PDF). NRMP. Retrieved 6 May 2021.
  3. ^ a b Gusfield & Irving 1989, pp. 3–4. Description of market based on Roth 1984.
  4. ^ a b Roth, Alvin E. (December 8, 2012). "The Theory and Practice of Market Design" (PDF). Nobelprize.org. Nobel Media AB.
  5. ^ Alvin E. Roth (2003). "The Origins, History, and Design of the Resident Match". JAMA. 289 (7): 909–912. doi:10.1001/jama.289.7.909. PMID 12588278. Retrieved 6 May 2021.
  6. ^ "THE MATCHING PLAN FOR THE APPOINTMENT OF INTERNS". JAMA. Retrieved 6 May 2021.
  7. ^ "About NRMP". NRMP. Retrieved 6 May 2021.
  8. ^ Medical seniors hit interne plan. New York Times 1951; 22 Oct:25 (col. 1).
  9. ^ Shiller JG. An alum recalls the first matching plan. P&S: The Journal of the College of Physicians & Surgeons of Columbia University 1985; 5:29.
  10. ^ Williams KJ. A reexamination of the NRMP matching algorithm. Acad Med 1995; 70:470-476.
  11. ^ Peranson E, Randlett R. Comments on Williams' "A reexamination of the NRMP matching algorithm". Acad Med. 1995;70:490-494. (footnote at the bottom of page 492)
  12. ^ a b Gale D, Shapley LS. College admissions and the stability of marriage. American Mathematics Monthly. 1962;69:9-15.
  13. ^ Roth & Peranson 1999, p. 748.
  14. ^ Robinson, Sara (April 2003). "Are Medical Students Meeting Their (Best Possible) Match?" (PDF). SIAM News (3): 36. Archived from the original (PDF) on 18 November 2016. Retrieved 14 October 2010.
  15. ^ Gusfield & Irving 1989, p. 64 references Roth 1984 as proving that the pre-1995 algorithm is essentially the hospital-optimal algorithm described in Gusfield & Irving 1989, p. 39. Gusfield & Irving 1989, p. 41 demonstrates that the hospital-optimal algorithm is also applicant-pessimal.
  16. ^ Williams KJ, Werth VP, Wolff JA. An analysis of the resident match. N Engl J Med. 1981;304:1165-1166; correspondence in N Engl J Med. 1981;305:526
  17. ^ Roth, A.E. (1984). "The evolution of the labor market for medical interns and residents: a case study in game theory". Journal of Political Economy. 92 (6): 991–1016. CiteSeerX 10.1.1.535.561. doi:10.1086/261272.
  18. ^ Klaus B, Klijn F, Massó J. Some things couples always wanted to know about stable matchings (but were afraid to ask). Review of Economic Design 2007; 11:175-184.
  19. ^ a b c Roth & Peranson 1999, p. 749.
  20. ^ Evaluation of changes to be considered in the NRMP algorithm, by Alvin E. Roth. October 24, 1995
  21. ^ Roth & Peranson 1999, p. 752, 760.
  22. ^ Gusfield & Irving 1989, p. 38.
  23. ^ Gusfield & Irving 1989, p. 41.
  24. ^ Gusfield & Irving 1989, p. 59.
  25. ^ "Analysis of the National Residency Matching Program". Tedlab.mit.edu. Archived from the original on 2013-03-25. Retrieved 2013-09-09.
  26. ^ Ronn, Eytan (June 1990). "NP-complete stable matching problems". Journal of Algorithms. 11 (2): 285–304. doi:10.1016/0196-6774(90)90007-2. ISSN 0196-6774.
  27. ^ Gusfield & Irving 1989, p. 54 gives an example of a situation with no stable solution and states that proof of NP completeness comes from Ronn 1990.[26]
  28. ^ Roth & Peranson 1999, p. 759.
  29. ^ Roth & Peranson 1999, p. 757.
  30. ^ Roth & Peranson 1999, p. 758.
  31. ^ Roth & Peranson 1999.
  32. ^ a b c [1] Archived December 26, 2011, at the Wayback Machine
  33. ^ a b "Using "SOAP" to Clean Up the Scramble". Studentdoctor.net. 2010-10-24. Retrieved 2013-09-09.
  34. ^ "The Residency Scramble: How It Works and How It Can Be Improved". Studentdoctor.net. 2009-03-12. Archived from the original on 2013-08-18. Retrieved 2013-09-09.
  35. ^ "Frequently Asked Questions : U.S. Seniors". Archived from the original on December 2, 2011. Retrieved December 6, 2011.
  36. ^ "Main match results" (PDF). Nrmp.org. 2016. Retrieved 2019-06-14.
  37. ^ "2021 Main Residency Match® By the Numbers*" (PDF). nrmp.org. NRMP. Retrieved 19 April 2021.
  38. ^ The Registration Process.
  39. ^ Residency Match Application.
  40. ^ Antitrust Against the Resident Match.
  41. ^ Robinson S. Antitrust Lawsuit Over Medical Residency System Is Dismissed. Aug. 2004.
  42. ^ Wilde, H.; Knight, V.; Gillard, J. (2020). "Matching: A Python library for solving matching games". Journal of Open Source Software. 5 (48): 2169. Bibcode:2020JOSS....5.2169W. doi:10.21105/joss.02169.
  43. ^ Klein, T. (2015). "Analysis of Stable Matchings in R: Package matchingMarkets" (PDF). Vignette to R Package MatchingMarkets.
  44. ^ "matchingMarkets: Analysis of Stable Matchings". R Project. 8 August 2023.
  45. ^ "MatchingTools API".

Sources

edit
edit
Retrieved from "https://en.wikipedia.org/w/index.php?title=National_Resident_Matching_Program&oldid=1256141749"