Question: java The stable matching algorithm: Given the following rankings of students and hospitals: (a) Run the Gale-Shapley algorithm (no need to show the details). What

java
The stable matching algorithm: Given the following rankings of students and hospitals: (a) Run the Gale-Shapley algorithm (no need to show the details). What is the match list? (b) Run the algorithm again, but this time the other way around - that the students are the ones giving offers (it doesn't work like that in real life, I know). What is the match list? (c) Remember that the original algorithm gives a student-pessimal, hospital-optimal match. Vanessa wants to improve her position, so she cheats and presents the following false preference list: Chicago, Denver, Atlanta, Boston, El Paso. The table is now: Run the Gale Shapley algorithm (the original - where the hospitals make the offers). What is the match list now? Did Vanessa improve her prospects with respect to her true preference list? Did she get her student-optimal match (from (b))
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
