Fair ranking methods ensure equal exposure for user groups and categories
Hidden Disparities in Ranking: Category-Aware Fairness via Distributional Stability
Machine Learning
Summary
Recommender systems often show different sets of items to different users, which can lead to unfair exposure for certain groups. This study defines fairness as giving equal attention to all users and within each category of items users interact with. The researchers found fairness can be understood as keeping user satisfaction stable even when the mix of user groups changes. They created a mathematical method to find fair ranking strategies and tested it to confirm their theory.
What this means in practice
- •For recommender system engineers: Design ranking algorithms that provide fair exposure to items across different user groups and product categories to improve perceived fairness and user experience.
- •For advertising platform developers: Balance ad exposure fairly across different audience segments and product types using distributional stability to ensure equitable ad ranking.
Authors
Gayane Taturyan, Charlotte Laclau, Stephan Clémençon
Abstract
We study the problem of fair ranking in recommender systems. We provide a formal probabilistic framework in which ranking policies are distributions over permutations, and the utility of a user is the exposure given to the items they interact with, relative to that of an ideal ranking. We consider utility parity across user groups, as well as its category-aware refinement, conditional utility parity, which requires parity within each category of items. Following a recent view of fairness as distributional stability, we show that both criteria are equivalent to the stability of the utility under changes in the composition of user groups. Optimizing over mixtures of ranking policies leads to a second-order cone program, for which we provide generalization bounds. A numerical study validates our theoretical findings.