Recommendation Fairness: From Static to Dynamic
–arXiv.org Artificial Intelligence
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.org Artificial Intelligence
Sep-13-2021
- Country:
- North America > United States
- New York > New York County
- New York City (0.11)
- Massachusetts > Suffolk County
- Boston (0.04)
- New York > New York County
- Europe
- United Kingdom > England
- Greater London > London (0.04)
- Cambridgeshire > Cambridge (0.04)
- Netherlands > North Holland
- Amsterdam (0.05)
- United Kingdom > England
- Asia > Myanmar
- Tanintharyi Region > Dawei (0.05)
- North America > United States
- Genre:
- Research Report (0.64)
- Instructional Material (0.46)
- Industry:
- Leisure & Entertainment > Games (0.46)