New exactly solvable examples for controlled discrete-time Markov chains
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3831758 (Why is no real title available?)
- scientific article; zbMATH DE number 3886816 (Why is no real title available?)
- scientific article; zbMATH DE number 3919523 (Why is no real title available?)
- scientific article; zbMATH DE number 3692995 (Why is no real title available?)
- scientific article; zbMATH DE number 3726027 (Why is no real title available?)
- scientific article; zbMATH DE number 3607837 (Why is no real title available?)
- scientific article; zbMATH DE number 3802533 (Why is no real title available?)
- Markov decision chains with unbounded costs and applications to the control of queues
- Markov programming by successive approximations with respect to weighted supremum norms
- Optimal and suboptimal stationary controls for Markov chains
- Stochastic optimal control. The discrete time case
Cited in
(2)
This page was built for publication: New exactly solvable examples for controlled discrete-time Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4007365)