Achieving fairness in the stochastic multi-armed bandit problem

MaRDI QIDQ5159459FDOQ5159459

Authors: Vishakha Patil, Ganesh Ghalme, Vineet Nair, Y. Narahari 

Publication date: 27 October 2021

Full work available at URL: https://arxiv.org/abs/1907.10516

Recommendations

• Mechanisms with learning for stochastic multi-armed bandit problems
• Constrained regret minimization for multi-criterion multi-armed bandits
• Regret analysis of stochastic and nonstochastic multi-armed bandit problems
• UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem

zbMATH Keywords

fairnessmachine learningonline learningreinforcement learningmulti-armed banditsupper confidence bounds

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Fairness through awareness
• Bandit algorithms
• Finite-time analysis of the multiarmed bandit problem
• Regret analysis of stochastic and nonstochastic multi-armed bandit problems
• Regret bounds for sleeping experts and bandits
• Introduction to multi-armed bandits
• Advancing subgroup fairness via sleeping experts
• Bandits with knapsacks
• Ranking with Fairness Constraints

Cited In (5)

• Achieving Optimal Fairness from Biased Coinflips
• Multi-armed linear bandits with latent biases
• On fair selection in the presence of implicit and differential variance
• Risk preferences of learning algorithms
• Fairness in learning-based sequential decision algorithms: a survey

This page was built for publication: Achieving fairness in the stochastic multi-armed bandit problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5159459)