Abstract
We study a new variant of the school choice problem in which capacities can be altered by distributing additional seats across schools in response to students’ reported preferences. We show that heuristics solutions to this capacity design problem can be inefficient, even if they focus on allocating seats to the most demanded schools. However, we introduce a simple myopic algorithm that characterizes the set of efficient matchings among those that respect priorities.
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.
