Comparing Fair Ranking Metrics
Amifa Raj, Michael D. Ekstrand

TL;DR
This paper compares various fairness metrics for ranked lists in information retrieval, providing a unified framework and empirical analysis to guide their application and understand their differences.
Contribution
It introduces a common notation for fair ranking metrics and empirically compares them across multiple datasets for search and recommendation tasks.
Findings
Metrics differ significantly in their assumptions and goals
Some metrics agree closely while others diverge in fairness assessment
Guidance is provided for selecting appropriate fairness metrics
Abstract
Ranked lists are frequently used by information retrieval (IR) systems to present results believed to be relevant to the users information need. Fairness is a relatively new but important aspect of these rankings to measure, joining a rich set of metrics that go beyond traditional accuracy or utility constructs to provide a more holistic understanding of IR system behavior. In the last few years, several metrics have been proposed to quantify the (un)fairness of rankings, particularly with respect to particular group(s) of content providers, but comparative analyses of these metrics -- particularly for IR -- is lacking. There is limited guidance, therefore, to decide what fairness metrics are applicable to a specific scenario, or assessment of the extent to which metrics agree or disagree applied to real data. In this paper, we describe several fair ranking metrics from existing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Advanced Bandit Algorithms Research · Auction Theory and Applications
