Multi-armed bandits with dependent arms
- 20 November 2023
- journal article
- research article
- Published by Springer Nature in Machine Learning
- Vol. 113 (1) , 45-71
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (CNS-1901057, CNS- 2007231, CNS-1618520, CNS-1409336)
- Anusandhan National Research Foundation (SRG/2021/002308)
This publication has 20 references indexed in Scilit:
- Stochastic bandits with side observations on networks2014
- Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual ObservationsIEEE/ACM Transactions on Networking, 2012
- Concentration inequality of maximum likelihood estimatorApplied Mathematics Letters, 2010
- Linearly Parameterized BanditsMathematics of Operations Research, 2010
- A contextual-bandit approach to personalized news article recommendation2010
- Online linear optimization and adaptive routingJournal of Computer and System Sciences, 2008
- Multi-armed bandit problems with dependent arms2007
- Convex Optimization2004
- A Probability PathJournal of the American Statistical Association, 2000
- Asymptotically efficient adaptive allocation rulesAdvances in Applied Mathematics, 1985