摘要：This paper proposes a new school choice mechanism called the recursive Boston mechanism (RBM), which is similar to the well-known Boston mechanism. While the Boston mechanism considers the reduced problem of the original problem after removing students and their assignments in the previous step, RBM considers the subproblem. We show that RBM does not satisfy strategy-proofness and stability, but satisfies Pareto efficiency. Moreover, the set of Nash equilibrium outcomes of the preference revelation game induced by RBM is equivalent to the set of stable matchings with respect to the true preferences of students.
关键词：School choice; Recursive Boston mechanism; Pareto efficiency
