Matchings, Predictions and Counterfactual Harm in Refugee Resettlement Processes
Not on the map. Why?
Abstract (arXiv)
Resettlement agencies have started to adopt data-driven algorithmic matching to match refugees to locations using employment rate as a measure of utility. Given a pool of refugees, data-driven algorithmic matching utilizes a classifier to predict the probability that each refugee would find employment at any given location. Then, it uses the predicted probabilities to estimate the expected utility of all possible placement decisions. Finally, it finds the placement decisions that maximize the predicted utility by solving a maximum weight bipartite matching problem. In this work, we argue that, using existing solutions, there may be pools of refugees for which data-driven algorithmic matching is (counterfactually) harmful -- it would have achieved lower utility than a given default policy used in the past, had it been used. Then, we develop a post-processing algorithm that, given placement decisions made by a default policy on a pool of refugees and their employment outcomes, solves an inverse~matching problem to minimally modify the predictions made by a given classifier. Under these modified predictions, the optimal matching policy that maximizes predicted utility on the pool is guaranteed to be not harmful. Further, we introduce a Transformer model that, given placement decisions made by a default policy on multiple pools of refugees and their employment outcomes, learns to modify the predictions made by a classifier so that the optimal matching policy that maximizes predicted utility under the modified predictions on an unseen pool of refugees is less likely to be harmful than under the original predictions. Experiments on simulated resettlement processes using synthetic refugee data created from a variety of publicly available data suggest that our methodology may be effective in making algorithmic placement decisions that are less likely to be harmful than existing solutions.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 11 of its 43 references that are in the map. First posted on arXiv 24 May 2024.
Builds on
11 of 43 references.
References · 11
- 2020Distribution-free binary classification: prediction sets, confidence intervals and calibrationcited by 79
- 2018PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Reviewcited by 30
- 2022Counterfactual harmcited by 29
- 2022A Causal Analysis of Harmcited by 15
- 2023Counterfactual Evaluation of Peer-Review Assignment Policiescited by 11
- 2022Quantifying Harmcited by 10
- 2021Optimal Kidney Exchange with Immunosuppressantscited by 9
- 2021Dynamic Placement in Refugee Resettlementcited by 7
- 2021Matching Algorithms for Blood Donationcited by 7
- 2023Group fairness in dynamic refugee assignmentcited by 6
- 2022Inverse optimization problems with multiple weight functionscited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Towards Human-AI Complementarity in Matching Taskscited by 7
- 2025Towards Human-AI Complementarity in Matching Tasks18 Aug 2025