Abstract
We study the trade-off between stability and students’ welfare in school choice problems. We call a matching weakly stable if none of its blocking pairs can be matched in a more stable matching–one with a weakly smaller set of blocking pairs. A matching is said to be self-constrained efficient if for students it is not Pareto dominated by any more stable matching, and it is self-constrained optimal if it weakly Pareto dominates all such matchings. We show that the following are equivalent for any matching: (i) it is weakly stable and self-constrained efficient; (ii) it is self-constrained optimal; (iii) it is an efficiency-adjusted deferred acceptance mechanism (EADAM) outcome under some consenting constraint; and (iv) it is exactly the EADAM outcome when its own set of blocking pairs is used as consenting constraint.
Sign-in/Register to access full text options 
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.
