IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/70374.html

Reducing the role of random numbers in matching algorithms for school admission

Author

Listed:
  • Hulsbergen, Wouter

Abstract

New methods for solving the college admissions problem with indifference are presented and characterised with a Monte Carlo simulation in a variety of simple scenarios. Based on a qualifier defined as the average rank, it is found that these methods are more efficient than the Boston and Deferred Acceptance algorithms. The improvement in efficiency is directly related to the reduced role of random tie-breakers. The strategy-proofness of the new methods is assessed as well.

Suggested Citation

  • Hulsbergen, Wouter, 2016. "Reducing the role of random numbers in matching algorithms for school admission," MPRA Paper 70374, University Library of Munich, Germany.
    • Handle: RePEc:pra:mprapa:70374
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/70374/1/MPRA_paper_70374.pdf
    File Function: original version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth, 2009. "Strategy-proofness versus Efficiency in Matching with Indifferences: Redesigning the New York City High School Match," NBER Working Papers 14864, National Bureau of Economic Research, Inc.
    2. Atila Abdulkadiroglu & Yeon-Koo Che & Yosuke Yasuda, 2011. "Resolving Conflicting Preferences in School Choice: The "Boston Mechanism" Reconsidered," American Economic Review, American Economic Association, vol. 101(1), pages 399-410, February.
    3. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth, 2009. "Strategy-Proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match," American Economic Review, American Economic Association, vol. 99(5), pages 1954-1978, December.
    4. 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.
    5. Roth, Alvin E & Sotomayor, Marilda, 1989. "The College Admissions Problem Revisited," Econometrica, Econometric Society, vol. 57(3), pages 559-570, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Harless, Patrick, 2014. "A School Choice Compromise: Between Immediate and Deferred Acceptance," MPRA Paper 61417, University Library of Munich, Germany.
    2. Alexander Westkamp, 2013. "An analysis of the German university admissions system," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 53(3), pages 561-589, August.
    3. Monique De Haan & Pieter A. Gautier & Hessel Oosterbeek & Bas van der Klaauw, 2023. "The Performance of School Assignment Mechanisms in Practice," Journal of Political Economy, University of Chicago Press, vol. 131(2), pages 388-455.
    4. Parag A. Pathak & Tayfun Sönmez, 2013. "School Admissions Reform in Chicago and England: Comparing Mechanisms by Their Vulnerability to Manipulation," American Economic Review, American Economic Association, vol. 103(1), pages 80-106, February.
    5. Fuhito Kojima & M. Ünver, 2014. "The “Boston” school-choice mechanism: an axiomatic approach," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 55(3), pages 515-544, April.
    6. Hatfield, John William & Kojima, Fuhito & Narita, Yusuke, 2016. "Improving schools through school choice: A market design approach," Journal of Economic Theory, Elsevier, vol. 166(C), pages 186-211.
    7. Andre Veski & Kaire Põder, 2016. "Strategies in the Tallinn School Choice Mechanism," Research in Economics and Business: Central and Eastern Europe, Tallinn School of Economics and Business Administration, Tallinn University of Technology, vol. 8(1).
    8. Atila Abdulkadiroglu & Tommy Andersson, 2022. "School Choice," NBER Working Papers 29822, National Bureau of Economic Research, Inc.
    9. Andre Veski & Kaire Põder, 2015. "Primary School Choice in Tallinn: Data and Simulations," TUT Economic Research Series 20, Department of Finance and Economics, Tallinn University of Technology.
    10. Basteck, Christian & Klaus, Bettina & Kübler, Dorothea, 2021. "How lotteries in school choice help to level the playing field," Games and Economic Behavior, Elsevier, vol. 129(C), pages 198-237.
    11. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
    12. Tong Wang & Congyi Zhou, 2020. "High school admission reform in China: a welfare analysis," Review of Economic Design, Springer;Society for Economic Design, vol. 24(3), pages 215-269, December.
    13. Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.
    14. Alvin E. Roth, 2010. "Marketplace Institutions Related to the Timing of Transactions," NBER Working Papers 16556, National Bureau of Economic Research, Inc.
    15. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    16. Lars Ehlers & Bettina Klaus, 2012. "Strategy-Proofness Makes the Difference : Deferred-Acceptance with Responsive Priorities," Cahiers de recherche 15-2012, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    17. Yasushi Kawase & Keisuke Bando, 2021. "Subgame perfect equilibria under the deferred acceptance algorithm," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(2), pages 503-546, June.
    18. Minoru Kitahara & Yasunori Okumura, 2021. "Improving efficiency in school choice under partial priorities," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(4), pages 971-987, December.
    19. Andrew McLennan & Shino Takayama & Yuki Tamura, 2024. "An Efficient, Computationally Tractable School Choice Mechanism," Discussion Papers Series 668, School of Economics, University of Queensland, Australia.
    20. Ha, Wei & Kang, Le & Song, Yang, 2020. "College matching mechanisms and matching stability: Evidence from a natural experiment in China," Journal of Economic Behavior & Organization, Elsevier, vol. 175(C), pages 206-226.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • I2 - Health, Education, and Welfare - - Education

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:70374. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.