arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.02562cs.DS
收藏

设计公平匹配

Fair-by-design matching

David García-Soriano, Francesco Bonchi

摘要:

匹配算法通常用于将供体与受体匹配以进行实体器官移植,用于将住院医师分配到医院,数据库中的记录链接,在机器上调度作业,网络切换,在线广告和图像识别等。尽管对于一个给定的匹配问题可能存在许多最优解,但当一个解中应包含或不应包含的元素对应于个体时,公平地选择该解就变得至关重要。本文研究了匹配问题中的个体公平性。由于可能存在许多最大匹配,每一个都满足不同的个体集合,保证公平的唯一方法是通过随机化。因此,我们引入了分布式最大最小公平框架,它提供了,对于任何给定的输入实例,最强的保证可能同时为所有个人的满意度概率(在解决方案中匹配的概率)。具体地说,如果不可能在不降低其他一些没有更好的个体的满意概率的情况下提高任何个体的满意概率,则可行解的概率分布是最大最小公平的。在二分图匹配的特殊情况下,我们的框架相当于Bogomolnaia和Mouline的平等主义机制。我们的主要贡献是一个多项式时间算法的公平匹配建设技术从最小割,边着色算法,经常二分图,和横向理论。对于二部图,我们的算法运行在$O((|V|^2 + |E||V|^{2/3}) \cdot (\log |V|)^2)$预期的时间和规模的图与数以千万计的顶点和数亿条边。据我们所知,这是第一次大规模实施平等机制。

英文摘要:

Matching algorithms are used routinely to match donors to recipients for solid organs transplantation, for the assignment of medical residents to hospitals, record linkage in databases, scheduling jobs on machines, network switching, online advertising, and image recognition, among others. Although many optimal solutions may exist to a given matching problem, when the elements that shall or not be included in a solution correspond to individuals, it becomes of paramount importance that the solution be selected fairly. In this paper we study individual fairness in matching problems. Given that many maximum matchings may exist, each one satisfying a different set of individuals, the only way to guarantee fairness is through randomization. Hence we introduce the distributional maxmin fairness framework which provides, for any given input instance, the strongest guarantee possible simultaneously for all individuals in terms of satisfaction probability (the probability of being matched in the solution). Specifically, a probability distribution over feasible solutions is maxmin-fair if it is not possible to improve the satisfaction probability of any individual without decreasing it for some other individual which is no better off. In the special case of matchings in bipartite graphs, our framework is equivalent to the egalitarian mechanism of Bogomolnaia and Mouline. Our main contribution is a polynomial-time algorithm for fair matching building on techniques from minimum cuts, and edge-coloring algorithms for regular bipartite graphs, and transversal theory. For bipartite graphs, our algorithm runs in $O((|V|^2 + |E||V|^{2/3}) \cdot (\log |V|)^2)$ expected time and scales to graphs with tens of millions of vertices and hundreds of millions of edges. To the best of our knowledge, this provides the first large-scale implementation of the egalitarian mechanism.

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

↑