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. 1805.01237
  4. Cited By
An Asymptotically Optimal Strategy for Constrained Multi-armed Bandit
  Problems

An Asymptotically Optimal Strategy for Constrained Multi-armed Bandit Problems

3 May 2018
H. Chang
ArXivPDFHTML

Papers citing "An Asymptotically Optimal Strategy for Constrained Multi-armed Bandit Problems"

5 / 5 papers shown
Title
Constrained Pure Exploration Multi-Armed Bandits with a Fixed Budget
Constrained Pure Exploration Multi-Armed Bandits with a Fixed Budget
Fathima Zarin Faizal
Jayakrishnan Nair
8
4
0
27 Nov 2022
Almost Optimal Variance-Constrained Best Arm Identification
Almost Optimal Variance-Constrained Best Arm Identification
Yunlong Hou
Vincent Y. F. Tan
Zixin Zhong
11
10
0
25 Jan 2022
Multi-Armed Bandits with Censored Consumption of Resources
Multi-Armed Bandits with Censored Consumption of Resources
Viktor Bengs
Eyke Hüllermeier
21
2
0
02 Nov 2020
An Index-based Deterministic Asymptotically Optimal Algorithm for
  Constrained Multi-armed Bandit Problems
An Index-based Deterministic Asymptotically Optimal Algorithm for Constrained Multi-armed Bandit Problems
H. Chang
11
0
0
29 Jul 2020
Constrained regret minimization for multi-criterion multi-armed bandits
Constrained regret minimization for multi-criterion multi-armed bandits
Anmol Kagrecha
Jayakrishnan Nair
Krishna Jagannathan
6
7
0
17 Jun 2020
1