The performance of forwards induction policies

DOI10.1016/0304-4149(93)90009-SzbMath0778.90084OpenAlexW2079733133MaRDI QIDQ2368171

J. C. Gittins, Kevin D. Glazebrook

Publication date: 2 September 1993

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-4149(93)90009-s

zbMATH Keywords

probabilistic analysisstochastic schedulingGittins indexmulti-armed bandit problemsorder constraintsforwards induction

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Probabilistic games; gambling (91A60)

Related Items

A forwards induction approach to candidate drug selection, Stochastic scheduling and forwards induction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evaluating Strategies for Markov Decision Processes in Parallel
• The Multi-Armed Bandit Problem: Decomposition and Computation
• On a reduction principle in dynamic programming
• Stoppable families of alternative bandit processes
• Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
• On a sufficient condition for superprocesses due to whittle
• On Scheduling Chains of Jobs on One Processor with Limited Preemption
• Stochastic scheduling with order constraints
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Myopic Solutions of Affine Dynamic Models
• Strategy evaluation for stochastic scheduling problems with order constraints