A note on simultaneous recurrence conditions on a set of denumerable stochastic matrices
From MaRDI portal
Publication:4178271
Cited in
(14)- Finite state approximation algorithms for average cost denumerable state Markov decision processes
- On zero-sum two-person undiscounted semi-Markov games with a multichain structure
- On undiscounted semi-Markov decision processes with absorbing states
- Recurrence conditions for Markov decision processes with Borel state space: A survey
- Semi-Markov decision processes with limiting ratio average rewards
- Necessary and sufficient conditions for a bounded solution to the optimality equation in average reward Markov decision chains
- Necessary conditions for the optimality equation in average-reward Markov decision processes
- Computing semi-stationary optimal policies for multichain semi-Markov decision processes
- Elimination of eanlomization in semi-Markov decision models with average cost criterion
- Zero-sum risk-sensitive stochastic games on a countable state space
- Characterization and sufficient conditions for normed ergodicity of Markov chains
- Semi-Markov decision processes with vector pay-offs
- Recent results on conditions for the existence of average optimal stationary policies
- Denumerable state semi-Markov decision processes with unbounded costs, average cost criterion
This page was built for publication: A note on simultaneous recurrence conditions on a set of denumerable stochastic matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178271)
