Abstract
We analyze sequential preference submission in centralized matching problems. Our motivation comes from school districts and colleges that use an application website where students submit their preferences over schools sequentially, after learning information about previous submissions. Comparing the widely used Boston Mechanism (BM) to the celebrated Deferred Acceptance (DA) mechanism, we show that a sequential implementation of BM can achieve superior equilibrium outcomes relative to the student-optimal stable matching. Our empirical tests use data from the field and from a laboratory experiment. We find that sequential preference submission may allow students to overcome the coordination problem in school choice. Our findings may have important policy implications in numerous places across the world where BM is currently in use.
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.
