IDEAS home Printed from https://ideas.repec.org/p/mtl/montec/04-2006.html

Respecting Priorities when Assigning Students to Schools

Author

Listed:
  • EHLERS, Lars

Abstract

We consider the problem of assigning students to schools on the basis of priorities. Students are allowed to have equal priority at a school. We characterize the efficient rules which weakly/strongly respect students’ priorities. When priority orderings are not strict, it is not possible to simply break ties in a fixed manner. All possibilities of resolving the indifferences need to be considered. Neither the deferred acceptance algorithm nor the top trading cycle algorithm successfully solve the problem of efficiently assigning the students to schools whereas a modified version of the deferred acceptance algorithm might. In this version tie breaking depends on students’ preferences.

Suggested Citation

  • EHLERS, Lars, 2006. "Respecting Priorities when Assigning Students to Schools," Cahiers de recherche 04-2006, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    • Handle: RePEc:mtl:montec:04-2006
    as

    Download full text from publisher

    File URL: http://www.cireqmontreal.com/wp-content/uploads/cahiers/04-2006-cah.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Atila Abdulkadiro?lu & Yeon-Koo Che & Yosuke Yasuda, 2015. "Expanding "Choice" in School Choice," American Economic Journal: Microeconomics, American Economic Association, vol. 7(1), pages 1-42, February.
    2. Han, Xiang, 2018. "Stable and efficient resource allocation under weak priorities," Games and Economic Behavior, Elsevier, vol. 107(C), pages 1-20.
    3. Yu, Jingsheng & Zhang, Jun, 2020. "A market design approach to job rotation," Games and Economic Behavior, Elsevier, vol. 120(C), pages 180-192.
    4. Aytek Erdil, 2013. "Strategy-Proof Stochastic Assignment," Cambridge Working Papers in Economics 1333, Faculty of Economics, University of Cambridge.
    5. Erdil, Aytek, 2014. "Strategy-proof stochastic assignment," Journal of Economic Theory, Elsevier, vol. 151(C), pages 146-162.
    6. Yu Gu & Yongchao Zhang, 2024. "On the solvability of three-agent task allocation with unqualified agents priority structures," Review of Economic Design, Springer;Society for Economic Design, vol. 28(2), pages 435-453, June.
    7. 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.
    8. Aytek Erdil & Haluk Ergin, 2008. "What's the Matter with Tie-Breaking? Improving Efficiency in School Choice," American Economic Review, American Economic Association, vol. 98(3), pages 669-689, June.
    9. Gu, Yu & Zhang, Yongchao, 2024. "On two mechanisms in job rotation problems," Journal of Mathematical Economics, Elsevier, vol. 111(C).
    10. Kesten, Onur & Unver, Utku, 2015. "A theory of school choice lotteries," Theoretical Economics, Econometric Society, vol. 10(2), May.
    11. Atila Abdulkadiroglu & Tommy Andersson, 2022. "School Choice," NBER Working Papers 29822, National Bureau of Economic Research, Inc.
    12. EHLERS, Lars & WESTKAMP, Alexander, 2011. "Strategy-Proof Tie-Breaking," Cahiers de recherche 2011-07, Universite de Montreal, Departement de sciences economiques.
    13. 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.

    More about this item

    Keywords

    ;
    ;
    ;

    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:mtl:montec:04-2006. 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: Sharon BREWER (email available below). General contact details of provider: https://edirc.repec.org/data/cdmtlca.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.