scientific article; zbMATH DE number 7415117

MaRDI QIDQ5159459

Ganesh Ghalme, Vineet Nair, Vishakha Patil, Yadati Narahari

Publication date: 27 October 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fairnessonline learningreinforcement learningmachine learningupper confidence boundsmulti-armed bandits

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Fairness in learning-based sequential decision algorithms: a survey

Cites Work

• Regret bounds for sleeping experts and bandits
• Fairness through awareness
• Bandits with Knapsacks
• Ranking with Fairness Constraints
• Bandit Algorithms
• Introduction to Multi-Armed Bandits
• Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
• Advancing subgroup fairness via sleeping experts
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: