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.
公平算法的研究已经成为机器学习和人工智能的主流,因为它在处理偏见和歧视方面的需求越来越大。沿着这条线,研究人员已经考虑了传统优化问题的公平版本,包括聚类,回归,排名和投票。然而,大多数的努力已被引导到设计启发式算法,这往往不提供任何保证的解决方案的质量。在这项工作中,我们研究匹配问题的比例公平的概念。比例公平是最流行的群体公平概念之一,其中每个群体的代表程度与最终选择的大小成比例。在[Chierichetti et al.,AISTATS,2019],其中仅对两组进行了研究。然而,在许多实际应用中,组的数量-尽管通常是一个小常数-大于2。在这项工作中,我们对理解的计算复杂性的比例公平匹配两个以上的群体的第一步。我们设计精确和近似算法,实现合理的保证匹配的质量以及时间复杂度。我们的算法也支持适当的硬度界限。
Approximation Algorithms for Perfect Fair-Triangle Packing
Gianforte School of Computing, Montana State University(蒙大拿州立大学 Gianforte 计算机学院);Division of Information System Design, Tokyo Denki University(东京电机大学信息系统设计系)