3 ms·
Also, the stability that you are asking for may be impossible to attain. Consider the simple one-to-one matching case, between {A, B} to {1, 2}. A prefers 1, B
by smallnamespace 8y ago
Also, the stability that you are asking for may be impossible to attain.
Consider the simple one-to-one matching case, between {A, B} to {1, 2}. A prefers 1, B prefers 2, but 1 prefers B and 2 prefers A.
No matter what assignment we come up with, either A/B will want to trade, or 1/2 will want to trade.
In your world, how do you solve this dynamic cyclicality?
- andrenth 8y agoThe situation here is not the same as what you describe, though, is it? Schools don't have preferences, they just have a number of available spots. I don't see how this cycle could happen in this case.