Hostname: page-component-74656f9884-kv2lp Total loading time: 0 Render date: 2026-11-05T10:18:21.667Z Has data issue: false hasContentIssue false

The Gittins index is optimal for dynamic allocation with conditionally independent filtrations

Published online by Cambridge University Press:  26 October 2026

Christopher Wang*
Affiliation:
Cornell University
*
*Postal address: Department of Mathematics, Cornell University, USA. Email: cyw33@cornell.edu
Rights & Permissions [Opens in a new window]

Abstract

The dynamic allocation problem, also known as the ‘multi-armed bandit’ problem, simulates a situation in which an agent is faced with a tradeoff between actions that yield an immediate reward and actions whose benefits can only be perceived in the future. In this paper, we see that the non-Markovian, discrete-time problem can be solved by following a Gittins index strategy, without the assumption that the rewards processes are independent. Instead, we require the underlying multi-parameter filtration to satisfy a conditional independence property. Three representations of the maximal attainable value are provided under an optimal strategy. Furthermore, we discuss the relationship between index-type strategies and the ‘synchronization’ paradigm from operations research.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BYCreative Common License - NC
This is an Open Access article, distributed under the terms of the Creative Commons Attribution-NonCommercial licence (https://creativecommons.org/licenses/by-nc/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original article is properly cited. The written permission of Cambridge University Press or the rights holder(s) must be obtained prior to any commercial use.
Copyright
© The Author(s), 2026. Published by Cambridge University Press on behalf of Applied Probability Trust