论文标题
关于Fa*ir的显着性调整的注释，有两个受保护的组
A Note on the Significance Adjustment for FA*IR with Two Protected Groups
论文作者
论文摘要
在本报告中，我们从Zehlike等人的Fa*ir算法进行了改善，该算法与该保护组的最低比例$ p $相结合而没有起作用。我们展示了如何准确计算每个排名位置的最小候选人数量，并提供从显着性水平的连续空间（$α$）到离散表的映射，从而使我们可以使用二进制搜索启发式方法找到$α_C$。
In this report we provide an improvement of the significance adjustment from the FA*IR algorithm of Zehlike et al., which did not work for very short rankings in combination with a low minimum proportion $p$ for the protected group. We show how the minimum number of protected candidates per ranking position can be calculated exactly and provide a mapping from the continuous space of significance levels ($α$) to a discrete space of tables, which allows us to find $α_c$ using a binary search heuristic.
