Explainable Disparity Compensation for Efficient Fair Ranking
Abraham Gale, Amélie Marian
摘要
Ranking functions that are used in decision systems often produce disparate results for different populations because of bias in the underlying data. Addressing, and compensating for, these disparate outcomes is a critical problem for fair decision-making. Recent compensatory measures have mostly focused on opaque transformations of the ranking functions to satisfy fairness guarantees or on the use of quotas or set-asides to guarantee a minimum number of positive outcomes to members of underrepresented groups. In this paper we propose easily explainable data-driven compensatory measures for ranking functions. Our measures rely on the generation of bonus points given to members of underrepresented groups to address disparity in the ranking function. The bonus points can be set in advance, and can be combined, allowing for considering the intersections of representations and giving better transparency to stakeholders. We propose efficient sampling-based algorithms to calculate the number of bonus points to minimize disparity. We validate our algorithms using real-world school admissions and recidivism datasets, and compare our results with that of existing fair ranking algorithms.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper1
相关 Paper
- Explaining Ranking FunctionsAbraham Gale, Amélie MarianVLDB 2021 · 被引用 14 次
- Detection of Groups with Biased Representation in RankingJinyang Li, Yuval Moskovitch, H. V. JagadishICDE 2023 · 被引用 10 次
- On the Problem of Underranking in Group-Fair RankingSruthi Gorantla, Amit Deshpande, Anand LouisICML 2021 · 被引用 26 次
- Rank Aggregation Algorithms for Fair ConsensusCaitlin Kuhlman, Elke A. RundensteinerVLDB 2020 · 被引用 60 次
- Pairwise Sample Complexity for Fair Active Ranking with Cascaded Norm ObjectivesSruthi Gorantla, Sara AhmadianKDD 2025
