IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2501.02686.html
   My bibliography  Save this paper

Paired Course and Dorm Allocation

Author

Listed:
  • Eric Gao

Abstract

Consider a university administrator who must assign students to both courses and dorms and runs (random) serial dictatorship independently in each market. While serial dictatorship is efficient for each individual matching problem holding the other fixed, Pareto improvements can be found via students jointly trading their allocated course and dorm. To align priorities with students' relative preferences between courses and dorms, we introduce paired serial dictatorship: a novel mechanism where students signal relative preferences to influence their priority in each market. Any deterministic allocation that arises in equilibrium is Pareto efficient, pointing towards ad-hoc tie-breaking as the key barrier to optimality. When students differ only in relative preferences, paired serial dictatorship ex-ante Pareto dominates running random serial dictatorship in each market. Such gains are realized despite students never reporting full preferences, a key advantage over other combinatorial allocation mechanisms that scale poorly with problem size.

Suggested Citation

  • Eric Gao, 2025. "Paired Course and Dorm Allocation," Papers 2501.02686, arXiv.org, revised May 2025.
    • Handle: RePEc:arx:papers:2501.02686
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Kazuya Kikuchi & Yukio Koriyama, 2024. "A general impossibility theorem on Pareto efficiency and Bayesian incentive compatibility," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 62(4), pages 789-797, June.
    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.

      More about this item

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