mlsanityData to 14 Oct 2026

The Gittins Index: A Design Principle for Decision-Making Under Uncertainty

arXiv 2506.10872 ↗First posted 12 Jun 2025math.OC cs.LG cs.PFcited by 6

Not on the map. Why?

Abstract (arXiv)

The Gittins index is a tool that optimally solves a variety of decision-making problems involving uncertainty, including multi-armed bandit problems, minimizing mean latency in queues, and search problems like the Pandora's box model. However, despite the above examples and later extensions thereof, the space of problems that the Gittins index can solve perfectly optimally is limited, and its definition is rather subtle compared to those of other multi-armed bandit algorithms. As a result, the Gittins index is often regarded as being primarily a concept of theoretical importance, rather than a practical tool for solving decision-making problems. The aim of this tutorial is to demonstrate that the Gittins index can be fruitfully applied to practical problems. We start by giving an example-driven introduction to the Gittins index, then walk through several examples of problems it solves - some optimally, some suboptimally but still with excellent performance. Two practical highlights in the latter category are applying the Gittins index to Bayesian optimization, and applying the Gittins index to minimizing tail latency in queues.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 33 of its 133 references that are in the map. First posted on arXiv 12 Jun 2025.

Builds on

33 of 133 references.

References · 33

  1. 2019Introduction to Multi-Armed Banditscited by 481
  2. 2019Differentiable Convex Optimization Layerscited by 465
  3. 2021Efficient and Modular Implicit Differentiationcited by 203
  4. 2021HPOBench: A Collection of Reproducible Multi-Fidelity Benchmark Problems for HPOcited by 112
  5. 2020Efficient Rollout Strategies for Bayesian Optimizationcited by 19
  6. 2021A Nonmyopic Approach to Cost-Constrained Bayesian Optimizationcited by 19
  7. 2016Deadline Scheduling as Restless Banditscited by 16
  8. 2024Cost-aware Bayesian Optimization via the Pandora's Box Gittins Indexcited by 16
  9. 2017The Price of Information in Combinatorial Optimizationcited by 12
  10. 2020Pandora's Box Problem with Order Constraintscited by 12
  11. 2021Uniform Bounds for Scheduling with Job Size Estimatescited by 12
  12. 2015Regret Analysis of the Finite-Horizon Gittins Index Strategy for Multi-Armed Banditscited by 9
21 more
  1. 2019Pandora's Problem with Nonobligatory Inspectioncited by 9
  2. 2023Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumptioncited by 9
  3. 2016Descending Price Optimally Coordinates Searchcited by 8
  4. 2019The Markovian Price of Informationcited by 8
  5. 2023Weitzman's Rule for Pandora's Box with Correlationscited by 7
  6. 2022Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAScited by 6
  7. 2022Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation Schemecited by 5
  8. 2023Recent Developments in Pandora's Box Problem: Variants and Applicationscited by 5
  9. 2024Achieving Exponential Asymptotic Optimality in Average-Reward Restless Bandits without Global Attractor Assumptioncited by 5
  10. 2021Approximating Pandora's Box with Correlationscited by 4
  11. 2024Lagrangian Index Policy for Restless Bandits with Average Rewardcited by 4
  12. 2024Local hedging approximately solves Pandora's box problems with nonobligatory inspectioncited by 3
  13. 2024Combinatorial Selection with Costly Informationcited by 2
  14. 2025Markovian Search with Ex-Ante Constraints: Theory and Applications to Socially Aware Algorithmic Hiringcited by 2
  15. 2025Robust Gittins for Stochastic Schedulingcited by 2
  16. 2018Optimal Scheduling and Exact Response Time Analysis for Multistage Jobscited by 1
  17. 2021A Classical Search Game in Discrete Locationscited by 1
  18. 2021Optimizing the order of actions in contact tracingcited by 1
  19. 2024Matching with Nested and Bundled Pandora Boxescited by 1
  20. 2024Model Predictive Control is Almost Optimal for Restless Banditcited by 1
  21. 2025Combinatorial Markov Searchcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 4.

6 papers.