Fairness of Exposure in Stochastic Bandits
arXiv:2103.02735
Abstract
Contextual bandit algorithms have become widely used for recommendation in online systems (e.g. marketplaces, music streaming, news), where they now wield substantial influence on which items get exposed to the users. This raises questions of fairness to the items -- and to the sellers, artists, and writers that benefit from this exposure. We argue that the conventional bandit formulation can lead to an undesirable and unfair winner-takes-all allocation of exposure. To remedy this problem, we propose a new bandit objective that guarantees merit-based fairness of exposure to the items while optimizing utility to the users. We formulate fairness regret and reward regret in this setting, and present algorithms for both stochastic multi-armed bandits and stochastic linear bandits. We prove that the algorithms achieve sub-linear fairness regret and reward regret. Beyond the theoretical analysis, we also provide empirical evidence that these algorithms can fairly allocate exposure to different arms effectively.
arXiv comment29 pages, 10 figures, ICML 2021
References in corpus (11)
- A Contextual-Bandit Approach to Personalized News Article Recommendation
- Equality of Opportunity in Supervised Learning
- Fairness of Exposure in Rankings
- Beyond Personalization: Research Directions in Multistakeholder Recommendation
- Online Learning with an Unknown Fairness Metric
- User Fairness, Item Fairness, and Diversity for Rankings in Two-Sided Markets
- Policy Learning for Fairness in Ranking
- On preserving non-discrimination when combining expert advice
- An Algorithmic Framework to Control Bias in Bandit-based Personalization
- Fair Algorithms for Infinite and Contextual Bandits
- Group Fairness in Bandit Arm Selection