Strategic schools under the Boston mechanism revisited

We show that Ergin & Sönmez's (2006) results which show that for schools it is a dominant strategy to truthfully rank the students under the Boston mechanism, and that the Nash equilibrium outcomes in undominated strategies of the induced game are stable, rely crucially on two assumptions. First, (a) that schools need to be restricted to find all students acceptable, and (b) that students cannot observe the priorities set by the schools before submitting their preferences. We show that relaxing either assumption eliminates the strategy dominance, and that Nash equilibrium outcomes in undominated strategies for the simultaneous induced game in case (a) and subgame perfect Nash equilibria in case (b) may contain unstable matchings. We also show that when able to manipulate capacities, schools may only have an incentive to do so if students submit their preferences after observing the reported capacities.