Timezone: »

On the Problem of Underranking in Group-Fair Ranking
Sruthi Gorantla · Amit Jayant Deshpande · Anand Louis

Thu Jul 22 09:00 PM -- 11:00 PM (PDT) @

Bias in ranking systems, especially among the top ranks, can worsen social and economic inequalities, polarize opinions, and reinforce stereotypes. On the other hand, a bias correction for minority groups can cause more harm if perceived as favoring group-fair outcomes over meritocracy. Most group-fair ranking algorithms post-process a given ranking and output a group-fair ranking. In this paper, we formulate the problem of underranking in group-fair rankings based on how close the group-fair rank of each item is to its original rank, and prove a lower bound on the trade-off achievable for simultaneous underranking and group fairness in ranking. We give a fair ranking algorithm that takes any given ranking and outputs another ranking with simultaneous underranking and group fairness guarantees comparable to the lower bound we prove. Our experimental results confirm the theoretical trade-off between underranking and group fairness, and also show that our algorithm achieves the best of both when compared to the state-of-the-art baselines.

Author Information

Sruthi Gorantla (Indian Institute of Science)

I am a first-year PhD student in computer science at IISc Bangalore, where I am advised by Assistant Professor Anand Louis. I am also closely collaborating with Dr. Amit Deshpande from Microsoft Research India. Prior to this I finished my masters in computer science at IISc Bangalore and bachelors in computer science at NIT Warangal. I am broadly interested in algorithms, machine learning, and fairness.

Amit Jayant Deshpande (Microsoft Research)
Anand Louis (Indian Institute of Science, Bangalore, India)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors