A bisection/successive approximation method for computing Gittins indices
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 647772
- ERROR BOUNDS FOR CALCULATION OF THE GITTINS INDICES
- scientific article; zbMATH DE number 2189783
- scientific article; zbMATH DE number 4074343
- A Note on M. N. Katehakis' and Y.-R. Chen's Computation of the Gittins Index
- scientific article; zbMATH DE number 903755
- The bisection method in higher dimensions
- Computation for the fixed point index and its applications
- A discrete analogue of the Gel'fand-Levitan method
Cites work
- A Note on M. N. Katehakis' and Y.-R. Chen's Computation of the Gittins Index
- Arm-acquiring bandits
- Conditions for the Existence of Planning Horizons
- Discrete multiarmed bandits and multiparameter processes
- Distributed dynamic programming
- Extensions of the multiarmed bandit problem: The discounted case
- scientific article; zbMATH DE number 3889341 (Why is no real title available?)
- scientific article; zbMATH DE number 3906232 (Why is no real title available?)
- scientific article; zbMATH DE number 3687126 (Why is no real title available?)
- scientific article; zbMATH DE number 3474804 (Why is no real title available?)
- Linear Programming for Finite State Multi-Armed Bandit Problems
- On Bayesian models in stochastic scheduling
- Open bandit processes and optimal scheduling of queueing networks
- Optimal Search for the Best Alternative
- The Multi-Armed Bandit Problem: Decomposition and Computation
Cited in
(3)
This page was built for publication: A bisection/successive approximation method for computing Gittins indices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3970270)