IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v133y2025icp34-48.html
   My bibliography  Save this article

Optimal top-n policy

Author

Listed:
  • Hafalir, Isa
  • Pan, Siqi
  • Tomoeda, Kentaro

Abstract

A widely adopted affirmative action policy in the university sector is the “top-n” policy, where the universities guarantee admission to students in the top n fraction of their class from every high school. The efficacy of the top-n policy in university integration has been questioned because students strategically relocate to low-achieving high schools. We show that when minorities are less likely to strategize than others, the policy can even segregate minorities from the target university, compared to the school-blind policy. A suitably chosen eligibility requirement, featuring the minimum time students must spend at a high school in order to be eligible for top-n admissions, can restore the efficacy of this policy. However, the most stringent requirement is not always optimal. The optimal requirement depends on the original distribution of students across high schools.

Suggested Citation

  • Hafalir, Isa & Pan, Siqi & Tomoeda, Kentaro, 2025. "Optimal top-n policy," Mathematical Social Sciences, Elsevier, vol. 133(C), pages 34-48.
    • Handle: RePEc:eee:matsoc:v:133:y:2025:i:c:p:34-48
    DOI: 10.1016/j.mathsocsci.2024.12.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489624001033
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2024.12.001?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.

    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:eee:matsoc:v:133:y:2025:i:c:p:34-48. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.