Normalized Markov Decision Chains I; Sensitive Discount Optimality
From MaRDI portal
Publication:4080985
Cited in
(5)- Resolvent expansions of matrices and applications
- Transient policies in discrete dynamic programming: Linear programming including suboptimality tests and additional constraints
- A canonical form for pencils of matrices with applications to asymptotic linear programs
- On the reduction of total-cost and average-cost MDPs to discounted mdps
- Markov branching decision chains with interest-rate-dependent rewards
This page was built for publication: Normalized Markov Decision Chains I; Sensitive Discount Optimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4080985)