A Note on the Equivalence of Upper Confidence Bounds and Gittins Indices for Patient Agents
Not on the map. Why?
Abstract (arXiv)
This note gives a short, self-contained, proof of a sharp connection between Gittins indices and Bayesian upper confidence bound algorithms. I consider a Gaussian multi-armed bandit problem with discount factor γ. The Gittins index of an arm is shown to equal the γ-quantile of the posterior distribution of the arm's mean plus an error term that vanishes as γ→ 1. In this sense, for sufficiently patient agents, a Gittins index measures the highest plausible mean-reward of an arm in a manner equivalent to an upper confidence bound.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Apr 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1.
2 papers.
- 2021Rate-optimal Bayesian Simple Regret in Best Arm Identificationcited by 11
- 2022Dynamic mean field programmingcited by 0
- 2022Dynamic mean field programming10 Jun 2022
- 2021Rate-optimal Bayesian Simple Regret in Best Arm Identification18 Nov 2021