ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1703.10010
  4. Cited By
Optimal Policies for Observing Time Series and Related Restless Bandit
  Problems

Optimal Policies for Observing Time Series and Related Restless Bandit Problems

29 March 2017
C. Dance
T. Silander
ArXiv (abs)PDFHTML

Papers citing "Optimal Policies for Observing Time Series and Related Restless Bandit Problems"

4 / 4 papers shown
Title
Model Predictive Control is Almost Optimal for Restless Bandit
Model Predictive Control is Almost Optimal for Restless Bandit
Nicolas Gast
Dheeraj Narasimha
59
1
0
08 Oct 2024
Partially-Observable Sequential Change-Point Detection for
  Autocorrelated Data via Upper Confidence Region
Partially-Observable Sequential Change-Point Detection for Autocorrelated Data via Upper Confidence Region
Haijie Xu
Xiaochen Xian
Chen Zhang
Kaibo Liu
60
0
0
30 Mar 2024
Learning Multiple Markov Chains via Adaptive Allocation
Learning Multiple Markov Chains via Adaptive Allocation
M. S. Talebi
Odalric-Ambrym Maillard
57
1
0
27 May 2019
Active Exploration in Markov Decision Processes
Active Exploration in Markov Decision Processes
Jean Tarbouriech
A. Lazaric
73
50
0
28 Feb 2019
1