mlsanityData to 14 Oct 2026

Matched Pair Calibration for Ranking Fairness

arXiv 2306.03775 ↗First posted 6 Jun 2023cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

We propose a test of fairness in score-based ranking systems called matched pair calibration. Our approach constructs a set of matched item pairs with minimal confounding differences between subgroups before computing an appropriate measure of ranking error over the set. The matching step ensures that we compare subgroup outcomes between identically scored items so that measured performance differences directly imply unfairness in subgroup-level exposures. We show how our approach generalizes the fairness intuitions of calibration from a binary classification setting to ranking and connect our approach to other proposals for ranking fairness measures. Moreover, our strategy shows how the logic of marginal outcome tests extends to cases where the analyst has access to model scores. Lastly, we provide an example of applying matched pair calibration to a real-word ranking data set to demonstrate its efficacy in detecting ranking bias.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 8 of its 22 references that are in the map. First posted on arXiv 6 Jun 2023.

Builds on

8 of 22 references.

References · 8

  1. 2016Equality of Opportunity in Supervised Learningcited by 2,007
  2. 2017On Fairness and Calibrationcited by 406
  3. 2018Fairness of Exposure in Rankingscited by 190
  4. 2019Fairness-Aware Ranking in Search & Recommendation Systems with Application to LinkedIn Talent Searchcited by 138
  5. 2019Fairness in Recommendation Ranking through Pairwise Comparisonscited by 127
  6. 2013Cluster-Robust Variance Estimation for Dyadic Datacited by 6
  7. 2022Simpson's Paradox in Recommender Fairness: Reconciling differences between per-user and aggregated evaluationscited by 5
  8. 2021An Outcome Test of Discrimination for Ranked Listscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.