Fair Pairs: Fairness-Aware Ranking Recovery from Pairwise Comparisons
Georg Ahnert, Antonio Ferrara, Claudia Wagner
TL;DR
The paper studies fairness-aware ranking recovery from pairwise comparisons, addressing biases in both candidate sampling and human judgments. It introduces a group-conditioned evaluation framework, including the Group-Conditioned Weighted Kemeny Distance $D^G_t(r)$ and exposure measures, and evaluates multiple recovery methods. Findings show that Fairness-Aware PageRank generally reduces exposure bias and improves fairness under various sampling schemes, while GNNRank with FA*IR achieves the lowest overall error in some scenarios but can increase group disparities. The work highlights the trade-offs between accuracy and fairness in ranking recovery and provides an open-source Python package to facilitate replication and future research.
Abstract
Pairwise comparisons based on human judgements are an effective method for determining rankings of items or individuals. However, as human biases perpetuate from pairwise comparisons to recovered rankings, they affect algorithmic decision making. In this paper, we introduce the problem of fairness-aware ranking recovery from pairwise comparisons. We propose a group-conditioned accuracy measure which quantifies fairness of rankings recovered from pairwise comparisons. We evaluate the impact of state-of-the-art ranking recovery algorithms and sampling approaches on accuracy and fairness of the recovered rankings, using synthetic and empirical data. Our results show that Fairness-Aware PageRank and GNNRank with FA*IR post-processing effectively mitigate existing biases in pairwise comparisons and improve the overall accuracy of recovered rankings. We highlight limitations and strengths of different approaches, and provide a Python package to facilitate replication and future work on fair ranking recovery from pairwise comparisons.
