Beyond Exposure: Optimizing Ranking Fairness with Non-linear Time-Income Functions

• URL: http://arxiv.org/abs/2602.03345v1
• Date: Tue, 03 Feb 2026 10:11:24 GMT
• Title: Beyond Exposure: Optimizing Ranking Fairness with Non-linear Time-Income Functions
• Authors: Xuancheng Li, Tao Yang, Yujia Zhou, Qingyao Ai, Yiqun Liu,
• Abstract summary: We study ranking fairness when the provider utility is influenced by other contextual factors and is neither equal to nor proportional to item exposure.<n>We propose the Dynamic-Income-Derivative-aware Ranking Fairness algorithm, which uses Taylor-expansion-based gradients to simultaneously optimize effectiveness and income fairness.
• Score: 27.771995549036813
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Ranking is central to information distribution in web search and recommendation. Nowadays, in ranking optimization, the fairness to item providers is viewed as a crucial factor alongside ranking relevance for users. There are currently numerous concepts of fairness and one widely recognized fairness concept is Exposure Fairness. However, it relies primarily on exposure determined solely by position, overlooking other factors that significantly influence income, such as time. To address this limitation, we propose to study ranking fairness when the provider utility is influenced by other contextual factors and is neither equal to nor proportional to item exposure. We give a formal definition of Income Fairness and develop a corresponding measurement metric. Simulated experiments show that existing-exposure-fairness-based ranking algorithms fail to optimize the proposed income fairness. Therefore, we propose the Dynamic-Income-Derivative-aware Ranking Fairness algorithm, which, based on the marginal income gain at the present timestep, uses Taylor-expansion-based gradients to simultaneously optimize effectiveness and income fairness. In both offline and online settings with diverse time-income functions, DIDRF consistently outperforms state-of-the-art methods.

Related papers

• Equity vs. Equality: Optimizing Ranking Fairness for Tailored Provider Needs [29.32978829799322]
  We introduce an equity-oriented fairness framework that explicitly models each provider's preferences over key outcomes such as exposure and sales.<n>We develop EquityRank, a gradient-based algorithm that jointly optimize user-side effectiveness and provider-side equity.
  arXiv  Detail & Related papers  (2026-01-31T03:44:31Z)
• Online Fair Division with Additional Information [7.435063833417366]
  We study the problem of fairly allocating indivisible goods to agents in an online setting.<n>We ask how the availability of information on future goods influences the existence and approximability of fair allocations.<n>We propose an algorithm that achieves stronger fairness guarantees than previously known results.
  arXiv  Detail & Related papers  (2025-05-30T12:06:16Z)
• Understanding Accuracy-Fairness Trade-offs in Re-ranking through Elasticity in Economics [96.68144350976637]
  Fairness is an increasingly important factor in re-ranking tasks.<n>The accuracy-fairness trade-off parallels the coupling of the commodity tax transfer process.<n>We introduce the Elastic Fairness Curve (EF-Curve) as an evaluation framework.<n>We also propose ElasticRank, a fair re-ranking algorithm that employs elasticity calculations to adjust inter-item distances.
  arXiv  Detail & Related papers  (2025-04-21T09:41:08Z)
• What's in a Query: Polarity-Aware Distribution-Based Fair Ranking [15.602253525743798]
  We propose new measures for attention distribution-based fairness in ranking.<n>We prove that group fairness is upper-bounded by individual fairness.<n>We find that prior research in amortized fair ranking ignores critical information about queries.
  arXiv  Detail & Related papers  (2025-02-17T04:38:36Z)
• Targeted Learning for Data Fairness [52.59573714151884]
  We expand fairness inference by evaluating fairness in the data generating process itself.<n>We derive estimators demographic parity, equal opportunity, and conditional mutual information.<n>To validate our approach, we perform several simulations and apply our estimators to real data.
  arXiv  Detail & Related papers  (2025-02-06T18:51:28Z)
• Consistent End-to-End Estimation for Counterfactual Fairness [56.9060492313073]
  We propose a novel counterfactual fairness predictor for making predictions under counterfactual fairness.<n>We provide theoretical guarantees that our method is effective in ensuring the notion of counterfactual fairness.
  arXiv  Detail & Related papers  (2023-10-26T17:58:39Z)
• Sampling Individually-Fair Rankings that are Always Group Fair [9.333939443470944]
  A fair ranking task asks to rank a set of items to maximize utility subject to satisfying group-fairness constraints. Recent works identify uncertainty in the utilities of items as a primary cause of unfairness. We give an efficient algorithm that samples rankings from an individually-fair distribution while ensuring that every output ranking is group fair.
  arXiv  Detail & Related papers  (2023-06-21T01:26:34Z)
• FFB: A Fair Fairness Benchmark for In-Processing Group Fairness Methods [84.1077756698332]
  This paper introduces the Fair Fairness Benchmark (textsfFFB), a benchmarking framework for in-processing group fairness methods. We provide a comprehensive analysis of state-of-the-art methods to ensure different notions of group fairness.
  arXiv  Detail & Related papers  (2023-06-15T19:51:28Z)
• Fairness in Matching under Uncertainty [78.39459690570531]
  algorithmic two-sided marketplaces have drawn attention to the issue of fairness in such settings. We axiomatize a notion of individual fairness in the two-sided marketplace setting which respects the uncertainty in the merits. We design a linear programming framework to find fair utility-maximizing distributions over allocations.
  arXiv  Detail & Related papers  (2023-02-08T00:30:32Z)
• Towards Equal Opportunity Fairness through Adversarial Learning [64.45845091719002]
  Adversarial training is a common approach for bias mitigation in natural language processing. We propose an augmented discriminator for adversarial training, which takes the target class as input to create richer features.
  arXiv  Detail & Related papers  (2022-03-12T02:22:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.