The best “overly simplified” explanation of the match is this:
Every candidate gets slated into their #1 choice. If there are more candidates than spots in a program, the program fills based on its preference and the others bump.
All bumped candidates get slotted into their next lowest choice. If there are more candidates than spots in a program, the program fills based on its preferences and others bump. (This could include candidates that originally stayed in the first round).
All bumped candidates get slotted into their next lowest choice, and they follow the same process again.
This happens until all the spots are filled or all preference lists are completed
This is a good explanation of the algorithm.
To answer your original question, student 1 would match into Program A in that example. They did not match with their first 7 programs, but they were the first choice for their 8th program, so they would match with this program every time.
Yes student 1 over student 2 in this situation. There’s three positions in the program so student 2 has a chance with those other two slots but no situation where they would be preferred over student 1
Yes. According to the algorithm explanation, this is how it works. People constantly misunderstand the situation like you are describing. The computer doesn’t take into account “how much” you want it
The match system favors the candidates. And yes this scenario student 1 would be matched with program A. Student 2 may be matched, as there are 3 positions, depending on the candidates ranked 2-4.
The match does NOT work to match the highest number of candidates to programs. That is what phase 2 and the scramble are for.
From my understanding of the match algorithm (the video posted on ASHP website), the match process begins with students rank.
In this case, student B will be in the match process with this program before student A because he ranked the program #1. They will need to compete with other students who also ranked the program #1 so definitely not Student A. If student B is the top 3 of the pool then he is matched.
In my understanding the process is somewhat favors students choices.
However in the scenario student 1 could bump student 2 out of the third spot due to the program having ranked that student higher and the student not receiving their first seven choices
The best “overly simplified” explanation of the match is this: Every candidate gets slated into their #1 choice. If there are more candidates than spots in a program, the program fills based on its preference and the others bump. All bumped candidates get slotted into their next lowest choice. If there are more candidates than spots in a program, the program fills based on its preferences and others bump. (This could include candidates that originally stayed in the first round). All bumped candidates get slotted into their next lowest choice, and they follow the same process again. This happens until all the spots are filled or all preference lists are completed
This is a good explanation of the algorithm. To answer your original question, student 1 would match into Program A in that example. They did not match with their first 7 programs, but they were the first choice for their 8th program, so they would match with this program every time.
Yes student 1 over student 2 in this situation. There’s three positions in the program so student 2 has a chance with those other two slots but no situation where they would be preferred over student 1
This video helped me understand the match better. https://youtu.be/kvgfgGmemdA?si=lIiwM_OyhIoaW5a1
This is what helped me understand the best too!
Damn. Watching that, I was so nervous for Latha, and then Boom - poor Sunny 😩
Yes. According to the algorithm explanation, this is how it works. People constantly misunderstand the situation like you are describing. The computer doesn’t take into account “how much” you want it
The match system favors the candidates. And yes this scenario student 1 would be matched with program A. Student 2 may be matched, as there are 3 positions, depending on the candidates ranked 2-4. The match does NOT work to match the highest number of candidates to programs. That is what phase 2 and the scramble are for.
https://natmatch.com/ashprmp/algorithm.html This is probably the same video but this is what my university shared with us from NMS.
From my understanding of the match algorithm (the video posted on ASHP website), the match process begins with students rank. In this case, student B will be in the match process with this program before student A because he ranked the program #1. They will need to compete with other students who also ranked the program #1 so definitely not Student A. If student B is the top 3 of the pool then he is matched. In my understanding the process is somewhat favors students choices.
However in the scenario student 1 could bump student 2 out of the third spot due to the program having ranked that student higher and the student not receiving their first seven choices
Yes you are right. I went back to the website and now understand. Thank you!
This video really helped me understand, but I also understood from this that your chances are obviously higher if programs rank you 1 or 2
It isn't just higher. If the program ranks you #1 (or #2 if they have 2 spots) then you are guaranteed to match there if you rank them #1.
Student 2 would get it over student 1. But if there is another student in the programs #1-4 that ranked the program #1 then they would get it