School Choice: An analysis of the strategic behaviour of students and schools in the student high-school allocation problem

Kyara Lucas

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.

Full Text:

PDF

References


Paul Milgrom and Ilya Segal (2015) Deferred-acceptance auctions and radio spectrum reallocation.

Kojima, F., Unver, M. U. (2013) ¨ The “Boston” school-choice mechanism: an axiomatic approach. Economic Theory, 55(3).

Atila Abdulkadiro˘glu and Tayfun S¨onmez (2013) School Choice: A Mechanism Design Approach. American Economic Review 93-3: 729-747.

M.S. Pini, F. Rossi, K.B. Venable, T. Walsh (2009) Manipulation and gender neutrality in stable marriage procedures. Proc. of 8th Int. Conf. on Autonomous Agents

and Multiagent Systems.




DOI: http://dx.doi.org/10.26481/marble.2018.v2.571

Refbacks

  • There are currently no refbacks.