A dynamic school choice model
This paper inspires from a real-life assignment problem faced by the Mexican Ministry of Public Education. We introduce a dynamic school choice problem that consists in assigning positions to overlapping generations of teachers. From one period to another, teachers can either retain their current positions or choose a preferred one. In this framework, a solution concept that conciliates the fairness criteria with the individual rationality condition is introduced. It is then proved that a solution always exists and that it can be reached by a modified version of the deferred acceptance algorithm of Gale and Shapley. We also show that the mechanism is dynamically strategy-proof, and respects improvements whenever the set of orders is lexicographic by tenure.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- M. Utku Ünver, 2010. "Dynamic Kidney Exchange," Review of Economic Studies, Oxford University Press, vol. 77(1), pages 372-414.
- Fuhito Kojima & Parag A. Pathak, 2009. "Incentives and Stability in Large Two-Sided Matching Markets," American Economic Review, American Economic Association, vol. 99(3), pages 608-27, June.
- Haluk I. Ergin, 2002. "Efficient Resource Allocation on the Basis of Priorities," Econometrica, Econometric Society, vol. 70(6), pages 2489-2497, November.
- Atila Abdulkadiroglu & Tayfun Sönmez, 2003. "School Choice: A Mechanism Design Approach," American Economic Review, American Economic Association, vol. 93(3), pages 729-747, June.
- Alessandro Citanna & Archishman Chakraborty & Michael Ostrovsky, 2010.
"Two-sided matching with interdependent values,"
- Francis Bloch & David Cantala, 2013.
"Markovian assignment rules,"
Social Choice and Welfare,
Springer;The Society for Social Choice and Welfare, vol. 40(1), pages 1-25, January.
- Francis Bloch & David Cantala, 2013. "Markovian assignment rules," PSE - Labex "OSE-Ouvrir la Science Economique" hal-01013737, HAL.
- Francis Bloch & David Cantala, 2008. "Markovian assignment rules," Working Papers hal-00356304, HAL.
- Francis Bloch & David Cantala, 2010. "Markovian assignment rules," Serie documentos de trabajo del Centro de Estudios Económicos 2010-18, El Colegio de México, Centro de Estudios Económicos.
- Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004.
The Quarterly Journal of Economics,
Oxford University Press, vol. 119(2), pages 457-488.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2003. "Kidney Exchange," NBER Working Papers 10002, National Bureau of Economic Research, Inc.
- Roth, Alvin & Ãœnver, M. Utku & SÃ¶nmez, Tayfun, 2004. "Kidney Exchange," Scholarly Articles 2580565, Harvard University Department of Economics.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2003. "Kidney Exchange," Game Theory and Information 0308002, EconWPA.
- Alvin E Roth, 2007.
"Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions,"
843644000000000283, UCLA Department of Economics.
- Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
- Roth, Alvin, 2008. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions," Scholarly Articles 2579651, Harvard University Department of Economics.
- Alvin E. Roth, 2007. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions," NBER Working Papers 13225, National Bureau of Economic Research, Inc.
- Tayfun Sönmez & M. Utku Ünver, 2009. "Matching, Allocation, and Exchange of Discrete Resources," Boston College Working Papers in Economics 717, Boston College Department of Economics.
- Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
- Roth, Alvin E., 1989. "Two-sided matching with incomplete information about others' preferences," Games and Economic Behavior, Elsevier, vol. 1(2), pages 191-209, June.
- Abdulkadiroglu, Atila & Sonmez, Tayfun, 1999. "House Allocation with Existing Tenants," Journal of Economic Theory, Elsevier, vol. 88(2), pages 233-260, October.
- Kurino Morimitsu, 2011. "House allocation with overlapping generations," Research Memorandum 032, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:80:y:2013:i:c:p:100-114. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.