Recommendation Fairness: From Static to Dynamic
arXiv:2109.03150
Abstract
Driven by the need to capture users' evolving interests and optimize their long-term experiences, more and more recommender systems have started to model recommendation as a Markov decision process and employ reinforcement learning to address the problem. Shouldn't research on the fairness of recommender systems follow the same trend from static evaluation and one-shot intervention to dynamic monitoring and non-stop control? In this paper, we portray the recent developments in recommender systems first and then discuss how fairness could be baked into the reinforcement learning techniques for recommendation. Moreover, we argue that in order to make further progress in recommendation fairness, we may want to consider multi-agent (game-theoretic) optimization, multi-objective (Pareto) optimization, and simulation-based optimization, in the general framework of stochastic games.
arXiv commentA position paper for the FAccTRec-2021 workshop. Revised based on the reviewers' feedback. 6 pages
References in corpus (13)
- Fairness of Exposure in Rankings
- Causal Intervention for Leveraging Popularity Bias in Recommendation
- Rainbow: Combining Improvements in Deep Reinforcement Learning
- Recommendations with Negative Feedback via Pairwise Deep Reinforcement Learning
- Fairness-Aware Ranking in Search & Recommendation Systems with Application to LinkedIn Talent Search
- Controlling Fairness and Bias in Dynamic Learning-to-Rank
- Towards Long-term Fairness in Recommendation
- Jointly Learning to Recommend and Advertise
- Algorithms for Fairness in Sequential Decision Making
- Learning Fair Policies in Multiobjective (Deep) Reinforcement Learning with Average and Discounted Rewards
- Learning Fairness in Multi-Agent Systems
- RecSim NG: Toward Principled Uncertainty Modeling for Recommender Ecosystems
- Balancing Accuracy and Fairness for Interactive Recommendation with Reinforcement Learning