Personalizing Fairness-aware Re-ranking

Abstract

Personalized recommendation brings about novel challenges in ensuring fairness, especially in scenarios in which users are not the only stakeholders involved in the recommender system. For example, the system may want to ensure that items from different providers have a fair chance of being recommended. To solve this problem, we propose a Fairness-Aware Re-ranking algorithm (FAR) to balance the ranking quality and provider-side fairness. We iteratively generate the ranking list by trading off between accuracy and the coverage of the providers. Although fair treatment of providers is desirable, users may differ in their receptivity to the addition of this type of diversity. Therefore, personalized user tolerance towards provider diversification is incorporated. Experiments are conducted on both synthetic and real-world data. The results show that our proposed re-ranking algorithm can significantly promote fairness with a slight sacrifice in accuracy and can do so while being attentive to individual user differences.

6 pages, 4 figures, 2nd FATREC Workshop on Responsible Recommendation

References in corpus (1)

• Multisided Fairness for Recommendation

Cited by in corpus (13)

• Managing Popularity Bias in Recommender Systems with Personalized Re-ranking
• The Unfairness of Popularity Bias in Recommendation
• Towards Individual and Multistakeholder Fairness in Tourism Recommender Systems
• Towards Fair Personalization by Avoiding Feedback Loops
• The Impact of Popularity Bias on Fairness and Calibration in Recommendation
• TFROM: A Two-sided Fairness-Aware Recommendation Model for Both Customers and Providers
• Vertical Allocation-based Fair Exposure Amortizing in Ranking
• Bias Disparity in Collaborative Recommendation: Algorithmic Evaluation and Comparison
• Balancing Accuracy and Fairness for Interactive Recommendation with Reinforcement Learning
• Reducing Popularity Bias in Recommendation Over Time
• A General Framework for Fairness in Multistakeholder Recommendations
• FAST: A Fairness Assured Service Recommendation Strategy Considering Service Capacity Constraint
• "And the Winner Is...": Dynamic Lotteries for Multi-group Fairness-Aware Recommendation