A REEXAMINATION OF THE NRMP MATCHING ALGORITHM

被引:23
|
作者
WILLIAMS, KJ
机构
[1] MED COLL PENN,PHILADELPHIA,PA 19129
[2] COLUMBIA UNIV,NEW YORK,NY 10027
关键词
D O I
10.1097/00001888-199506000-00007
中图分类号
G40 [教育学];
学科分类号
040101 ; 120403 ;
摘要
Most graduating medical students in the United States find their first professional appointments through the National Resident Matching Program (NRMP). This service receives rank-order lists of preferences from students and from hospitals, and then generates final assignments of students to hospitals through the use of a specific computerized matching algorithm. The author uses recent findings from the mathematics and economics literatures to demonstrate three difficulties with the NRMP's matching algorithm and the official descriptions thereof. First, the algorithm favors hospitals over students, a feature known to the NRMP since at least 1976, but, in the author's opinion, not made clear in NRMP literature for students. Second, the author argues that the NRMP's justification that its algorithm mimics orderly, noncentralized admission processes is not correct. Institutions operating under non-centralized procedures must typically make more initial offers than there are positions, in the realization that some fraction of their offers will be declined. This arrangement enlarges the choices available to many applicants, and thereby benefits them, whereas the NRMP's algorithm unrealistically assumes that no institution would ever send out any extra offers. Third, the NRMP's algorithm contains incentives for students to misrepresent their true preferences when constructing their rank-order lists. This feature is a substantial disadvantage of the current algorithm and is incorrectly described in literature distributed to students and in published articles from the NRMP. The author discusses the implications of these issues, specifically considering workable alternatives to the NRMP's algorithm; a rough estimate of how many students' assignments might be improved with-a change of algorithm; information for students about the difficulties in accommodating the incentives to misrepresent their preferences under the current algorithm; and ramifications for hospitals. The author recommends that research be done with authentic rank-order lists from students and hospitals to compare alternative algorithms and alternative strategies for participants to use when constructing rank-order lists; that the NRMP revise its literature for students to portray the current algorithm more accurately and in more detail; and that the choice of matching algorithm be reopened to debate because it is possible that the current algorithm is not the fairest one overall.
引用
收藏
页码:470 / 476
页数:7
相关论文
共 50 条
  • [31] An improved matching algorithm for feature points matching
    Yan Yuanhui
    Xia Haiying
    Huang Siqi
    Xiao Wenjing
    [J]. 2014 IEEE INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, COMMUNICATIONS AND COMPUTING (ICSPCC), 2014, : 292 - 296
  • [32] IMPROVED MATCHING ALGORITHM
    DORFLER, W
    MUHLBACHER, J
    [J]. COMPUTING, 1974, 13 (3-4) : 389 - 397
  • [33] SPECIAL MATCHING ALGORITHM
    KLEE, V
    VANDENDRIESSCHE, P
    [J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 23 (01): : A32 - A33
  • [34] Ensuring compliance with NRMP policy - Reply
    Beran, RL
    [J]. ACADEMIC MEDICINE, 1999, 74 (07) : 747 - 748
  • [35] NRMP AND PSYCHIATRY - ETHICAL PROBLEM - REPLY
    MYERS, JM
    [J]. JOURNAL OF CLINICAL PSYCHIATRY, 1979, 40 (02) : 110 - 110
  • [36] March. madness - The NRMP and the NCAA
    Wright, SM
    Ziegelstein, RC
    [J]. TEACHING AND LEARNING IN MEDICINE, 2003, 15 (02) : 113 - 115
  • [37] Matching Complexes of Trees and Applications of the Matching Tree Algorithm
    Marija Jelić Milutinović
    Helen Jenne
    Alex McDonough
    Julianne Vega
    [J]. Annals of Combinatorics, 2022, 26 : 1041 - 1075
  • [38] Matching Complexes of Trees and Applications of the Matching Tree Algorithm
    Milutinovic, Marija Jelic
    Jenne, Helen
    McDonough, Alex
    Vega, Julianne
    [J]. ANNALS OF COMBINATORICS, 2022, 26 (04) : 1041 - 1075
  • [39] Stereo matching algorithm based on the combination of matching costs
    Wang Ende
    Zhu Yalong
    Peng Liangyu
    Li Yijun
    Wu Tianyao
    [J]. 2017 IEEE 7TH ANNUAL INTERNATIONAL CONFERENCE ON CYBER TECHNOLOGY IN AUTOMATION, CONTROL, AND INTELLIGENT SYSTEMS (CYBER), 2017, : 1001 - 1004
  • [40] HIERARCHICAL CHAMFER MATCHING - A PARAMETRIC EDGE MATCHING ALGORITHM
    BORGEFORS, G
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1988, 10 (06) : 849 - 865