The paper analyzes the scope for manipulation in many-to-one matching markets (college admission problems) under the student-optimal stable mechanism when the number of participants is large and the length of the preference list is bounded. Under a mild independence assumption on the...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...