Asymptotically efficient adaptive allocation schemes for controlled i.i.d. processes: finite parameter space
From MaRDI portal
Publication:3818930
Recommendations
- Asymptotically efficient adaptive allocation schemes for controlled Markov chains: finite parameter space
- Asymptotically Efficient Adaptive Choice of Control Laws inControlled Markov Chains
- Bayesian adaptive control of discrete-time Markov processes with long-run average cost
- Adaptive control of diffusion processes with a discounted reward criterion
- scientific article; zbMATH DE number 440431
Cited in
(14)- Certainty equivalence control with forcing: Revisited
- Strong consistency of Bayes estimates in nonlinear stochastic regression models
- Open problems in universal induction \& intelligence
- Asymptotically efficient strategies for a stochastic scheduling problem with order constraints.
- Optimal strategies for a class of sequential control problems with precedence relations
- Arbitrary side observations in bandit problems
- Asymptotically efficient adaptive allocation schemes for controlled Markov chains: finite parameter space
- scientific article; zbMATH DE number 6982311 (Why is no real title available?)
- Learning the distribution with largest mean: two bandit frameworks
- Learning to optimize via information-directed sampling
- Matching while learning
- Bounded Regret for Finitely Parameterized Multi-Armed Bandits
- Individual fairness in hindsight
- Information-directed sampling for bandits: a primer
This page was built for publication: Asymptotically efficient adaptive allocation schemes for controlled i.i.d. processes: finite parameter space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818930)
