Dismiss Notice
SDN members see fewer ads and full resolution images. Join our non-profit community!

How does the ranking algorithm work?

Discussion in 'Clinical Rotations' started by alicelinden, Dec 20, 2001.

  1. alicelinden

    alicelinden Junior Member

    Joined:
    Dec 1, 2001
    Messages:
    11
    Likes Received:
    0
    I understand that the rank algorithm starts by picking a student, putting them in their top choice, going to the next student, etc. If a student's top choice is already full by previous students, then the computer will examine the program's rank list and bump off any students to squeeze this one in should this student be ranked higher by the program. This process continues until every program is full.

    I understand this algorithm gives precedence to the student's rank list, which is nice. But does this algorithm actually find a single optimal solution, or does the solution change depending on the order in which the algorithm considers the students? I'm hoping a computer science person can explain this.

    Also, say that I and another student are applying to... whatever... Hopvard Residency. Say that I rank Hopvard 1st, and the other student ranks Hopvard 2nd. However, Hopvard ranks the other student 1st and ranks me 2nd. Does this pose a problem for the algorithm? If the other student is pulled by her number 1 choice, then there's no conflict... but if her number choice didn't rank her highly enough, then we both are "equally eligible" for Hopvard... but won't I get it before her because the algorithm is student-biased rather than program-biased? (Or maybe it doesn't matter at all, as once other students get put into Hopvard, I'll get kicked out by the algorithm.)

    Are there any other possible problems (known or unknown) with the rank algorithm? People here seem to know about these things... Thanks!
     
  2. Thread continues after this sponsor message. SDN Members do not see this ad.

  3. Sabreman

    Sabreman Member

    Joined:
    Sep 20, 2001
    Messages:
    45
    Likes Received:
    0
    Well, you confused me on a topic I thought I understood. :p

    However, as far as you example goes, you are indeed on equal footing with the other student if she doesn't match with her #1 choice (Dukeford), but this IS student-biased because she is also a student. If she doesn't get her first choice, and you have temporarily filled the spot, the computer will bump you because her second choice ranked her first. If it did not, she would have been penalized for picking her unlikely but TRUE favorite (Dukeford) instead of the one she knew she could get into (Hopvard) and thus upsetting the Match student-biased algorithm.

    I think...
     
  4. Mr. happy clown guy

    Mr. happy clown guy Senior Member

    Joined:
    Jul 30, 2001
    Messages:
    236
    Likes Received:
    0
    Get on scutwork.com and it has a long example of the match.
     

Share This Page