On stable and efficient mechanisms for priority-based allocation problems
Abstract For school choice (priority-based allocation) problems, when the priority structure is acyclic, the associated student-proposing deferred acceptance algorithm is Pareto efficient and group strategy-proof ( Ergin, 2002 ). We reveal a hidden iterative removal structure behind such deferred acceptance algorithms. A nonempty set of students is called a top fair set (TFS) if when all students apply to their most preferred schools and all schools accept the best applicants up to their quotas, students in the set are always accepted, regardless of other students' preferences. We provide an elimination process to find the maximal TFS, if any TFS exists. We show that for any priority structure, iterative removal of TFS is equivalent to the associated deferred acceptance algorithm if and only if the latter is a Pareto efficient mechanism.