Abstract
We investigate efficient and minimally unstable Pareto improvements over the deferred acceptance (DA) mechanism — a popular school choice mechanism which is stable but not efficient. We show that there is no Pareto improvement over the DA mechanism which is minimally unstable among efficient assignments when the stability comparison is based on counting the number of blocking pairs. Our main result characterizes the priority profiles for which there exists a Pareto improvement over the DA assignment that is minimally unstable among efficient assignments. We further consider an alternative natural stability comparison based on the set of blocking students who are involved in at least one blocking pair, show that the impossibilities remain, and characterize the possibility domain of priority profiles.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
