Login / Signup

Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem.

Avrim BlumKavya Ravichandran
Published in: CoRR (2024)
Keyphrases
  • multi armed bandits
  • approximation guarantees
  • lower bound
  • approximation algorithms
  • np hard
  • worst case
  • greedy algorithm
  • bandit problems
  • upper bound
  • objective function
  • multi class
  • approximation ratio