Asymptotically efficient adaptive allocation schemes for controlled Markov chains: finite parameter space
From MaRDI portal
Recommendations
- Asymptotically efficient adaptive allocation schemes for controlled i.i.d. processes: finite parameter space
- Asymptotically Efficient Adaptive Choice of Control Laws inControlled Markov Chains
- Adaptive control of Markov chains with average cost
- On the Milito-Cruz adaptive control scheme for Markov chains
- Learning control of finite Markov chains with an explicit trade-off between estimation and control
Cited in
(9)- Certainty equivalence control with forcing: Revisited
- The multi-armed bandit problem: an efficient nonparametric solution
- Learning to optimize via information-directed sampling
- Optimal strategies for a class of sequential control problems with precedence relations
- Arbitrary side observations in bandit problems
- Open problems in universal induction \& intelligence
- Computing optimal policies for Markovian decision processes using simulation
- Strong consistency of Bayes estimates in nonlinear stochastic regression models
- Asymptotically efficient adaptive allocation schemes for controlled i.i.d. processes: finite parameter space
This page was built for publication: Asymptotically efficient adaptive allocation schemes for controlled Markov chains: finite parameter space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3032153)