Fair Algorithms for Infinite and Contextual Bandits
arXiv:1610.09559
Abstract
We study fairness in linear bandit problems. Starting from the notion of meritocratic fairness introduced in Joseph et al. [2016], we carry out a more refined analysis of a more general problem, achieving better performance guarantees with fewer modelling assumptions on the number and structure of available choices as well as the number selected. We also analyze the previously-unstudied question of fairness in infinite linear bandit problems, obtaining instance-dependent regret upper bounds as well as lower bounds demonstrating that this instance-dependence is necessary. The result is a framework for meritocratic fairness in an online linear setting that is substantially more powerful, general, and realistic than the current state of the art.
Cited by in corpus (6)
- Fairness in Machine Learning: A Survey
- What-is and How-to for Fairness in Machine Learning: A Survey, Reflection, and Perspective
- Fair Contextual Multi-Armed Bandits: Theory and Experiments
- Fairness of Exposure in Stochastic Bandits
- Combinatorial Sleeping Bandits with Fairness Constraints
- Avoiding Resentment Via Monotonic Fairness