3 ms·
I'm not familiar with Gale-Shapley -- but maybe exploiting the new on-line nature of the application process would be good. Have students rank, say 5 subjects
by e12e 11y ago
I'm not familiar with Gale-Shapley -- but maybe exploiting the new on-line nature of the application process would be good.
Have students rank, say 5 subjects and 5 colleges -- do a cut-off, and allow those cut to change or keep their choices (along with listing open positions after the current round).
Run the cut-off twice a day, for 20 days. If things don't balance out after 40 rounds, I suppose an entirely different system is needed.
I'm sure this could be modelled first, to check the viability.
- yomritoyj 11y agoBut then you are asking students to collectively act out an algorithm. Why not leave it to a machine?
- maxander 11y agoBecause the machine can't deduce each student's preferences. I suspect the problem is essentially unsolvable, without requiring each student to fully write out the order of his/her school preferences. Otherwise there will inevitably (if the solution to the Stable Marriage problem is optimal in this regard) be undecidable cases that would have to be dealt with in a second round.
- e12e 11y agoWe could assume that each student has as close to perfect knowledge about his/her preferences as is attainable. The student will have to work to communicate that to the system one way or another -- I'm suggesting that using several rounds might mean less work (and/or less unpleasant work) for the students, than if they have to fill out an impossible number of choices/preferences upfront -- just so the system have the data it needs to complete in one round. Which would be optimizing the wrong part of the problem (or even the wrong problem). No matter how interesting the problem might be from an algorithmic point of view.