arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.10642cs.GT
收藏

动态难民分配中的群体公平性

Group fairness in dynamic refugee assignment

Daniel Freund, Thodoris Lykouris, Elisabeth Paulson, Bradley Sturt, Wentao Weng

AI总结:

针对动态难民分配中的群体公平性问题,提出一个可解释框架,整合多种公平性定义,并设计两种出价算法,在几乎不损失全局性能(约1%-5%)的情况下显著提升公平性。

摘要:

确保难民和寻求庇护者在收容国能够繁荣发展(例如找到工作)是一个深远的人道主义目标,而就业的主要驱动因素是难民或寻求庇护者被分配到的收容国内的地理位置。近期研究提出并实施了将难民和寻求庇护者分配到地理位置以最大化所有到达难民平均就业率的算法。尽管这些算法可能产生显著的总体积极影响,但使用来自两个行业合作者的数据,我们表明这些算法的影响可能因原籍国、年龄或教育背景等关键子群体而有很大差异。因此,我们开发了一个简单且可解释的框架,用于将群体公平性纳入动态难民分配问题。特别是,该框架可以灵活地整合文献中许多现有和未来的群体公平性定义(例如,随机、组内比例优化和最大最小)。利用我们的框架,我们提出了两种出价算法,在最大化整体就业率的同时,提供可证明的群体公平性保证。通过使用各种群体公平性定义以及来自美国和荷兰的真实世界数据进行的大量数值实验,我们表明,与离线基准公平性约束相比,我们的算法可以在群体公平性方面带来显著改善,而全局性能仅相对小幅下降(约1%-5%)。

英文摘要:

Ensuring that refugees and asylum seekers thrive (e.g., find employment) in their host countries is a profound humanitarian goal, and a primary driver of employment is the geographic location within a host country to which the refugee or asylum seeker is assigned. Recent research has proposed and implemented algorithms that assign refugees and asylum seekers to geographic locations in a manner that maximizes the average employment across all arriving refugees. While these algorithms can have substantial overall positive impact, using data from two industry collaborators we show that the impact of these algorithms can vary widely across key subgroups based on country of origin, age, or educational background. Thus motivated, we develop a simple and interpretable framework for incorporating group fairness into the dynamic refugee assignment problem. In particular, the framework can flexibly incorporate many existing and future definitions of group fairness from the literature (e.g., Random, Proportionally Optimized within-group, and MaxMin). Equipped with our framework, we propose two bid-price algorithms that maximize overall employment while simultaneously yielding provable group fairness guarantees. Through extensive numerical experiments using various definitions of group fairness and real-world data from the U.S. and the Netherlands, we show that our algorithms can yield substantial improvements in group fairness compared to an offline benchmark fairness constraints, with only small relative decreases ($\approx$ 1%-5%) in global performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑