School Choice with Transferable Students' Characteristics

  1. Carmelo Rodríguez-Álvarez 1
  2. Antonio Romero-Medina 2
  1. 1 Universidad Complutense de Madrid
    info

    Universidad Complutense de Madrid

    Madrid, España

    ROR 02p0gd045

  2. 2 Universidad Carlos III de Madrid
    info

    Universidad Carlos III de Madrid

    Madrid, España

    ROR https://ror.org/03ths8210

Revista:
Documentos de Trabajo (ICAE)

ISSN: 2341-2356

Año de publicación: 2020

Número: 4

Páginas: 1-31

Tipo: Documento de Trabajo

Otras publicaciones en: Documentos de Trabajo (ICAE)

Resumen

We consider a school choice problem where schools' priorities depend on transferable students' characteristics. A school choice algorithm selects for each profile of students' preferences over schools an assignment of students to schools and a final allocation of characteristics (an extended matching). We define the Student Exchange with Transferable Characteristics (SETC) class of algorithms. Each SETC always selects a constrained efficient extended matching. That is an extended matching that i) is stable according to the priorities generated by the final allocation of characteristics and ii) is not Pareto dominated by another stable extended matching. Every constrained efficient extended matching that Pareto improves upon a stable extended matching can be obtained via an algorithm in the SETC class. When students' characteristics are fully transferable, a specific algorithm in the SETC family is equivalent to the application of the Top Trade Cycle Algorithm starting from the Student Optimal Stable Matching.

Información de financiación

Rodríguez-Alvarez is grateful for the financial support from Fundación Ramón Areces and Ministerio de Economía y Competitividad (Proyectos Excelencia ECO2016-76818, PID2019-107161GB-C32). Romero-Medina acknowledges financial support from Ministerio Economía y Competitividad grants ECO2017-87769-P and MDM 2014-043, and Comunidad de Madrid H2019/HUM-5891.

Financiadores

Referencias bibliográficas

  • Abdulkadiro˘glu, A., Y.K. Che, P. Pathak, A.E. Roth, and O. Tercieux (2019) “Efficiency, Justified Envy, and Incentives in Priority-Based Matching”. Forthcoming: American Economic Review: Insights.
  • Abdulkadiro˘glu, A., P. Pathak, and A.E. Roth (2009) “Strategy-proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match”. American Economic Review 99-5, 1954-1978.
  • Abdulkadiro˘glu, A., P. Pathak, A.E. Roth, and T. S¨onmez (2005b) “The Boston Public School Match”. American Economic Review 95-2, 368-371.
  • Abdulkadiro˘glu, A., and T. S¨onmez (2003) “School Choice: A Mechanism Design Approach”. American Economic Review 93-3, 729-747.
  • Alcalde, J., and A. Romero-Medina (2017) “Fair Student Placement”. Theory and Decision 83, 293-307.
  • Alva, S. and V. Manjunath (2019) “Strategy-Proof Pareto Improvements”. Journal of Economic Theory 181, 121-142.
  • Arnosti, N., (2016) “Centralized Clearinghouse Design: A Quantity-Quality Tradeoff”. Working Paper, Columbia Business School. Available at SSRN: http://dx.doi.org/10.2139/ssrn.2571527.
  • Ashlagi, I., A. Nikzad, and A. Romm (2019) “Assigning More Students to Their Top Choices: A Comparison of Tie-Breaking Rules”. Games and Economic Behavior 115, 767-187.
  • Balinski, M., and T. S¨onmez (1999), “A Tale of Two Mechanisms: Student Placement”. Journal of Economic Theory 84, 73-94.
  • Blum, Y., A.E. Roth, and U. Rothblum (1997) “Vacancy Chains and Equilibration in Senior-Level Labor Markets”. Journal of Economic Theory 76, 362-411.
  • Casalmiglia, C., M. G¨uell, and C. Fu (2020), “Structural Estimation of a Model of School Choices: the Boston Mechanism vs. Its Alternatives”. Journal of Political Economy 128 (2), 642-680.
  • Dur, U.M., A. Gitmez, and O. Yilmaz (2019) “School Choice under Partial Fairness”. ¨ Theoretical Economics 14-4, 1309–1346.
  • Dur, U.M., S.D. Kominers, P.A. Pathak, and T. S¨onmez (2018) “Reserve Design: Unintended Consequences and The Demise of Boston?s Walk Zones?. Journal of Political Economy, 126-6, 2457-2479.
  • Dur, U.M., T. Morrill (2017) “The Impossibility of Restricting Tradeable Priorities in School Assignment”. Unpublished mimeo, North Carolina State University.
  • Ehlers, L., and T. Morrill (2019) “(Il)legal Assignments in School Choice”. Forthcoming Review of Economic Studies.
  • Erdil, A., and H. Ergin (2008) “What’s the Matter with Tie-Breaking? Improving Efficiency in School Choice”. American Economic Review 98-3, 669-689.
  • Gale, D., L. Shapley (1962) “College Admissions and the Stability of Marriage”. American Mathematical Monthly 69, 9-15.
  • Górtazar, L., D. Mayor, and J. Montalb´an (2020) “School Choice Priorities and School Segregation: Evidence from Madrid”. Working Paper Series, Stockholm University - Swedish Institute for Social Research.
  • Hakimov, R., and O. Kesten (2018) “The Equitable Top Trading Cycles Mechanism for School Choice”. International Economic Review, 59-4, 2219-2258.
  • Kesten, O. (2010) “School Choice with Consent”. Quarterly Journal of Economics 125, 1297-1348.
  • Kesten, O., M. Kurino (2019) “Strategy-proof Improvements upon Deferred Acceptance: A Maximal Domain for Possibility”. Games and Economic Behavior 117, 120-143.
  • Morrill, T. (2016) “Petty Envy When Assigning Objects”. Working Paper, North Carolina State University.
  • Pathak, P. (2016) “What Really Matters in Designing School Choice Mechanisms”. Advances in Economics and Econometrics, 11 th World Congress of the Econometric Society.
  • Pathak, P., T. S¨onmez, M.U. Unver, and M.B. Yenmez (2020) “Leaving No Ethical Value Behind: Triage Protocol Design for Pandemic Rationing” NBER Working Paper No. 26951.
  • Ruijs, N., and H. Oosterbeek (2019) “School Choice in Amsterdam: Which Schools are Chosen When School Choice is Free?” Education Finance and Policy 14-1, 1-30.
  • Shapley, L., and H. Scarf (1974) “On Cores and Indivisibility”. Journal of Mathematical Economics 1, 23–37.
  • Tang, Q., and J. Yu, (2014) “A new perspective on Kesten’s school choice with consent idea”. Journal of Economic Theory 154, 543-561.