Vertical Allocation-based Fair Exposure Amortizing in Ranking

Abstract

Result ranking often affects consumer satisfaction as well as the amount of exposure each item receives in the ranking services. Myopically maximizing customer satisfaction by ranking items only according to relevance will lead to unfair distribution of exposure for items, followed by unfair opportunities and economic gains for item producers/providers. Such unfairness will force providers to leave the system and discourage new providers from coming in. Eventually, fewer purchase options would be left for consumers, and the utilities of both consumers and providers would be harmed. Thus, to maintain a balance between ranking relevance and fairness is crucial for both parties. In this paper, we focus on the exposure fairness in ranking services. We demonstrate that existing methods for amortized fairness optimization could be suboptimal in terms of fairness-relevance tradeoff because they fail to utilize the prior knowledge of consumers. We further propose a novel algorithm named Vertical Allocation-based Fair Exposure Amortizing in Ranking, or VerFair, to reach a better balance between exposure fairness and ranking performance. Extensive experiments on three real-world datasets show that VerFair significantly outperforms state-of-the-art fair ranking algorithms in fairness-performance trade-offs from both the individual level and the group level.

11 pages, 3 figures

References in corpus (17)

• Equality of Opportunity in Supervised Learning
• Translation-based Recommendation
• Controlling Fairness and Bias in Dynamic Learning-to-Rank
• Estimating Position Bias without Intrusive Interventions
• Explainable Fairness in Recommendation
• Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs
• Policy Learning for Fairness in Ranking
• Towards Fair Recommendation in Two-Sided Platforms
• Maximizing Marginal Fairness for Dynamic Learning to Rank
• Fair Ranking as Fair Division: Impact-Based Individual Fairness in Ranking
• FAIR: Fairness-Aware Information Retrieval Evaluation
• TFROM: A Two-sided Fairness-Aware Recommendation Model for Both Customers and Providers
• Marginal-Certainty-aware Fair Ranking Algorithm
• FARA: Future-aware Ranking Algorithm for Fairness Optimization
• Mitigating Exploitation Bias in Learning to Rank with an Uncertainty-aware Empirical Bayes Approach
• Calibrating Explore-Exploit Trade-off for Fair Online Learning to Rank
• Reinforcement Learning to Rank Using Coarse-grained Rewards

Cited by in corpus (1)

• Guaranteeing Accuracy and Fairness under Fluctuating User Traffic: A Bankruptcy-Inspired Re-ranking Approach