IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v72y2024i6p2375-2390.html
   My bibliography  Save this article

Outcome-Driven Dynamic Refugee Assignment with Allocation Balancing

Author

Listed:
  • Kirk Bansak

    (Department of Political Science, University of California, Berkeley, California 94720)

  • Elisabeth Paulson

    (Technology and Operations Management Unit, Harvard Business School, Boston, Massachusetts 02163)

Abstract

This study proposes two new dynamic assignment algorithms to match refugees and asylum seekers to geographic localities within a host country. The first, currently implemented in a multiyear randomized control trial in Switzerland, seeks to maximize the average predicted employment level (or any measured outcome of interest) of refugees through a minimum-discord online assignment algorithm. The performance of this algorithm is tested on real refugee resettlement data from both the United States and Switzerland, where we find that it is able to achieve near-optimal expected employment, compared with the hindsight-optimal solution, and is able to improve upon the status quo procedure by 40%–50%. However, pure outcome maximization can result in a periodically imbalanced allocation to the localities over time, leading to implementation difficulties and an undesirable workflow for resettlement resources and agents. To address these problems, the second algorithm balances the goal of improving refugee outcomes with the desire for an even allocation over time. We find that this algorithm can achieve near-perfect balance over time with only a small loss in expected employment compared with the employment-maximizing algorithm. In addition, the allocation balancing algorithm offers a number of ancillary benefits compared with pure outcome maximization, including robustness to unknown arrival flows and greater exploration.

Suggested Citation

  • Kirk Bansak & Elisabeth Paulson, 2024. "Outcome-Driven Dynamic Refugee Assignment with Allocation Balancing," Operations Research, INFORMS, vol. 72(6), pages 2375-2390, November.
    • Handle: RePEc:inm:oropre:v:72:y:2024:i:6:p:2375-2390
    DOI: 10.1287/opre.2022.0445
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.0445
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2022.0445?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
    ---><---

    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:inm:oropre:v:72:y:2024:i:6:p:2375-2390. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.