Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales

Terms and Conditions

Twitter GitHub LinkedIn Bluesky Youtube

© 2026 ResearchTrend.AI, All rights reserved.

Home
Papers
2001.11201
Cited By

Finite-Time Analysis of Round-Robin Kullback-Leibler Upper Confidence
Bounds for Optimal Adaptive Allocation with Multiple Plays and Markovian
Rewards

v1v2 (latest)

Finite-Time Analysis of Round-Robin Kullback-Leibler Upper Confidence Bounds for Optimal Adaptive Allocation with Multiple Plays and Markovian Rewards

30 January 2020

ArXiv (abs)PDF HTML

Papers citing "Finite-Time Analysis of Round-Robin Kullback-Leibler Upper Confidence Bounds for Optimal Adaptive Allocation with Multiple Plays and Markovian Rewards"

2 / 2 papers shown

Adaptive KL-UCB based Bandit Algorithms for Markovian and i.i.d.
Settings

Adaptive KL-UCB based Bandit Algorithms for Markovian and i.i.d. SettingsIEEE Transactions on Automatic Control (TAC), 2020

Member Ieee Arghyadip Roy

Fellow Ieee Sanjay Shakkottai

F. I. R. Srikant

468

4

0

14 Sep 2020

A Hoeffding Inequality for Finite State Markov Chains and its
Applications to Markovian Bandits

A Hoeffding Inequality for Finite State Markov Chains and its Applications to Markovian BanditsInternational Symposium on Information Theory (ISIT), 2020

408

14

0

05 Jan 2020

Page 1 of 1