Abstract
We investigate how the one-to-one deferred acceptance algorithm can be used to solve the many-to-one school choice problem. In the first part of the paper we derive the important properties of the one-to-one Deferred Acceptance algorithm. In the second part of the paper, we consider the Deferred Acceptance algorithm for solving the many-to-one school choice problem. Using insights from the first two parts of the paper we show that the Deferred Acceptance algorithm is strategy proof for students, and manipulable by schools under specific conditions.
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.
