A bisection/successive approximation method for computing Gittins indices
From MaRDI portal
Publication:3970270
DOI10.1007/BF01421548zbMath0735.90071MaRDI QIDQ3970270
Adi Ben-Israel, Sjur Didrik Flåm
Publication date: 25 June 1992
Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)
90C40: Markov and semi-Markov decision processes
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arm-acquiring bandits
- Discrete multiarmed bandits and multiparameter processes
- Conditions for the Existence of Planning Horizons
- Extensions of the multiarmed bandit problem: The discounted case
- Linear Programming for Finite State Multi-Armed Bandit Problems
- A Note on M. N. Katehakis' and Y.-R. Chen's Computation of the Gittins Index
- The Multi-Armed Bandit Problem: Decomposition and Computation
- Open bandit processes and optimal scheduling of queueing networks
- Optimal Search for the Best Alternative
- Distributed dynamic programming
- On Bayesian models in stochastic scheduling