mlsanityData to 14 Oct 2026

Fair Ranking as Fair Division: Impact-Based Individual Fairness in Ranking

arXiv 2206.07247 ↗First posted 15 Jun 2022cs.IR cs.AI cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

Rankings have become the primary interface in two-sided online markets. Many have noted that the rankings not only affect the satisfaction of the users (e.g., customers, listeners, employers, travelers), but that the position in the ranking allocates exposure -- and thus economic opportunity -- to the ranked items (e.g., articles, products, songs, job seekers, restaurants, hotels). This has raised questions of fairness to the items, and most existing works have addressed fairness by explicitly linking item exposure to item relevance. However, we argue that any particular choice of such a link function may be difficult to defend, and we show that the resulting rankings can still be unfair. To avoid these shortcomings, we develop a new axiomatic approach that is rooted in principles of fair division. This not only avoids the need to choose a link function, but also more meaningfully quantifies the impact on the items beyond exposure. Our axioms of envy-freeness and dominance over uniform ranking postulate that for a fair ranking policy every item should prefer their own rank allocation over that of any other item, and that no item should be actively disadvantaged by the rankings. To compute ranking policies that are fair according to these axioms, we propose a new ranking objective related to the Nash Social Welfare. We show that the solution has guarantees regarding its envy-freeness, its dominance over uniform rankings for every item, and its Pareto optimality. In contrast, we show that conventional exposure-based fairness can produce large amounts of envy and have a highly disparate impact on the items. Beyond these theoretical results, we illustrate empirically how our framework controls the trade-off between impact-based individual item fairness and user utility.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 24 of its 40 references that are in the map. First posted on arXiv 15 Jun 2022.

Builds on

24 of 40 references.

References · 24

  1. 2018Fairness of Exposure in Rankingscited by 190
  2. 2016Unbiased Learning-to-Rank with Biased Feedbackcited by 157
  3. 2018Equity of Attention: Amortizing Individual Fairness in Rankingscited by 124
  4. 2016Measuring Fairness in Ranked Outputscited by 81
  5. 2017Ranking with Fairness Constraintscited by 78
  6. 2020FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platformscited by 78
  7. 2019Policy Learning for Fairness in Rankingcited by 74
  8. 2020Controlling Fairness and Bias in Dynamic Learning-to-Rankcited by 68
  9. 2020Evaluating Stochastic Rankings with Expected Exposurecited by 53
  10. 2021Fairness of Exposure in Stochastic Banditscited by 43
  11. 2017Designing Fair Ranking Schemescited by 40
  12. 2021Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairnesscited by 36
12 more
  1. 2021Two-sided fairness in rankings via Lorenz dominancecited by 28
  2. 2020Interventions for Ranking in the Presence of Implicit Biascited by 27
  3. 2021Fairness in Ranking under Uncertaintycited by 27
  4. 2019FairSearch: A Tool For Fairness in Ranked Search Resultscited by 22
  5. 2021Online certification of preference-based fairness for personalized recommender systemscited by 22
  6. 2022Fair ranking: a critical review, challenges, and future directionscited by 21
  7. 2019Policy-Gradient Training of Fair and Unbiased Ranking Functionscited by 16
  8. 2021Optimizing Rankings for Recommendation in Matching Marketscited by 12
  9. 2018Fair Division Under Cardinality Constraintscited by 11
  10. 2018Envy-Free Classificationcited by 11
  11. 2021Maximizing Marginal Fairness for Dynamic Learning to Rankcited by 10
  12. 2019Scalable Fair Division for 'At Most One' Preferencescited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 6; 2025: 3; 2026: 2.

13 papers.

Sort: