IDEAS home Printed from https://ideas.repec.org/a/taf/applec/v53y2021i21p2412-2415.html
   My bibliography  Save this article

A recursive algorithm for student selection of schools in a constrained serial dictatorship mechanism

Author

Listed:
  • Yun Pu

Abstract

The constrained serial dictatorship mechanism is a popular method used in school admissions. However, due to the number of combinations possible, simulating the behaviour of students in their selection of schools and computing the best strategy for them to select a limited number of schools is currently a highly complex and time-consuming endeavour. The purpose of this study is to propose a recursive algorithm to significantly reduce this computational time and to provide an empirical application by employing this algorithm. To do this, I studied how the behaviours and utilities of students will change if provided with more choices for college admissions in Guangxi in China. The results indicate that neither the behaviours nor the utilities change significantly with the provision of more choices, which implies that increasing the available choices of schools for students in Guangxi would be a waste of resources.

Suggested Citation

  • Yun Pu, 2021. "A recursive algorithm for student selection of schools in a constrained serial dictatorship mechanism," Applied Economics, Taylor & Francis Journals, vol. 53(21), pages 2412-2415, May.
    • Handle: RePEc:taf:applec:v:53:y:2021:i:21:p:2412-2415
    DOI: 10.1080/00036846.2020.1861204
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00036846.2020.1861204
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00036846.2020.1861204?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    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:taf:applec:v:53:y:2021:i:21:p:2412-2415. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RAEC20 .

    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.