Fairness in Ranking: Robustness through Randomization without the Protected Attribute
Andrii Kliachkin, Eleni Psaroudaki, Jakub Marecek, Dimitris Fotakis
TL;DR
The paper tackles fairness in ranking when protected attributes may be unavailable, addressing the challenge of robustness across multiple fairness notions. It introduces a randomized post-processing approach using Mallows noise to produce approximately $P$-fair rankings without demographic data, and an ILP to optimize $DCG$/$NDCG$ under $(\\vec{\\alpha},\\vec{\\beta})$ fairness constraints when scores are known. Through extensive experiments on synthetic data and the German Credit dataset, the approach demonstrates robustness to unknown attributes while maintaining competitive ranking utility, illustrating the method's practical value for HR, advertising, and recommender systems. Overall, the work advances privacy-preserving, fairness-aware ranking by leveraging attribute-agnostic noise and exact constraint-based optimization.
Abstract
There has been great interest in fairness in machine learning, especially in relation to classification problems. In ranking-related problems, such as in online advertising, recommender systems, and HR automation, much work on fairness remains to be done. Two complications arise: first, the protected attribute may not be available in many applications. Second, there are multiple measures of fairness of rankings, and optimization-based methods utilizing a single measure of fairness of rankings may produce rankings that are unfair with respect to other measures. In this work, we propose a randomized method for post-processing rankings, which do not require the availability of the protected attribute. In an extensive numerical study, we show the robustness of our methods with respect to P-Fairness and effectiveness with respect to Normalized Discounted Cumulative Gain (NDCG) from the baseline ranking, improving on previously proposed methods.
