Fair Rank Aggregation

by   Diptarka Chakraborty, et al.

Ranking algorithms find extensive usage in diverse areas such as web search, employment, college admission, voting, etc. The related rank aggregation problem deals with combining multiple rankings into a single aggregate ranking. However, algorithms for both these problems might be biased against some individuals or groups due to implicit prejudice or marginalization in the historical data. We study ranking and rank aggregation problems from a fairness or diversity perspective, where the candidates (to be ranked) may belong to different groups and each group should have a fair representation in the final ranking. We allow the designer to set the parameters that define fair representation. These parameters specify the allowed range of the number of candidates from a particular group in the top-k positions of the ranking. Given any ranking, we provide a fast and exact algorithm for finding the closest fair ranking for the Kendall tau metric under block-fairness. We also provide an exact algorithm for finding the closest fair ranking for the Ulam metric under strict-fairness, when there are only O(1) number of groups. Our algorithms are simple, fast, and might be extendable to other relevant metrics. We also give a novel meta-algorithm for the general rank aggregation problem under the fairness framework. Surprisingly, this meta-algorithm works for any generalized mean objective (including center and median problems) and any fairness criteria. As a byproduct, we obtain 3-approximation algorithms for both center and median problems, under both Kendall tau and Ulam metrics. Furthermore, using sophisticated techniques we obtain a (3-ε)-approximation algorithm, for a constant ε>0, for the Ulam metric under strong fairness.


page 1

page 2

page 3

page 4


MANI-Rank: Multiple Attribute and Intersectional Group Fairness for Consensus Ranking

Combining the preferences of many rankers into one single consensus rank...

Proportionally Fair Matching with Multiple Groups

The study of fair algorithms has become mainstream in machine learning a...

The Lovasz-Bregman Divergence and connections to rank aggregation, clustering, and web ranking

We extend the recently introduced theory of Lovasz-Bregman (LB) divergen...

Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints

We study a novel problem of fairness in ranking aimed at minimizing the ...

FairFuse: Interactive Visual Support for Fair Consensus Ranking

Fair consensus building combines the preferences of multiple rankers int...

Fair Group-Shared Representations with Normalizing Flows

The issue of fairness in machine learning stems from the fact that histo...

Fair Algorithms for Learning in Allocation Problems

Settings such as lending and policing can be modeled by a centralized ag...

Please sign up or login with your details

Forgot password? Click here to reset