Games of school choice under the Boston mechanism with general priority structures
- 183 Downloads
The Boston mechanism is a centralized student assignment mechanism used in many school districts in the US. We investigate strategic behavior of students under the Boston mechanism when schools may have complex priority structures. We show that a stable matching is supported as an outcome of a Nash equilibrium under a general environment. We further show that any outcome of a Nash equilibrium is a stable matching when the school priorities are substitutable.
KeywordsNash Equilibrium School District Aggregate Demand Dominant Strategy Stable Match
Unable to display preview. Download preview PDF.
- Abdulkadiroğlu A, Pathak PA, Roth AE (2005a) The New York City high school match. Am Econ Rev Papers Proc 95: 364–367Google Scholar
- Abdulkadiroğlu A, Pathak PA, Roth AE, Sönmez T (2005b) The Boston public school match. Am Econ Rev Papers Proc 95: 368–372Google Scholar
- Abdulkadiroğlu A, Pathak PA, Roth AE, Sönmez T (2006) Changing the Boston school choice mechanism. Harvard University, Unpublished mimeoGoogle Scholar
- Ergin H, Sönmez T (2006) Games of school choice under the Boston mechanism. J Public Econ 215–237Google Scholar
- Haeringer G, Klijn F (2007) Constrained school choice. mimeoGoogle Scholar
- Hatfield JW, Kojima F (2007) Group incentive compatibility for matching with contracts. mimeoGoogle Scholar
- Roth AE, Sotomayor MO (1990) Two-sided matching: a study in game-theoretic modeling and analysis. Econometric Society Monographs, CambridgeGoogle Scholar