IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2608.20698.html

Priority Transparency, Admission Chances, and Information Acquisition in School Choice

Author

Listed:
  • Georgy Artemov
  • Siqi Pan

Abstract

We study, theoretically and experimentally, how transparency about students' priorities and admission chances shapes their incentives to acquire information about their own preferences in school choice and college admissions. In the model, uninformed students choose schools based on a common prior. When they learn their own preferences, their choices become more heterogeneous, which frees up seats at popular schools. Students who know they have high priority have stronger incentives to learn because they can more readily act on what they learn, whereas students who know they have low priority are discouraged. Full priority disclosure concentrates learning among high-priority students. By pooling priorities, partial disclosure spreads learning incentives to pooled students and yields higher welfare. In the laboratory, however, full disclosure yields the highest welfare instead, followed by partial disclosure, and then no disclosure, because greater transparency improves subjects' understanding of the strategic environment, leading to fewer mistakes. These findings support full disclosure of priorities or admission chances to guide information acquisition. However, deviations in learning remain even under greater priority transparency, partly because subjects respond suboptimally to admission chances when these are provided directly rather than inferred. Students' ability to interpret and use them is therefore itself a policy concern.

Suggested Citation

  • Georgy Artemov & Siqi Pan, 2026. "Priority Transparency, Admission Chances, and Information Acquisition in School Choice," Papers 2608.20698, arXiv.org.
  • Handle: RePEc:arx:papers:2608.20698
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2608.20698
    File Function: Latest version
    Download Restriction: no
    ---><---

    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:arx:papers:2608.20698. 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: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    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.