Killed Markov Decision Processes on Finite Time Interval for Countable Models
From MaRDI portal
Publication:3000266
zbMATH Open1228.90147arXiv1304.2495MaRDI QIDQ3000266FDOQ3000266
Authors: Nestor Parolya, Yaroslav I. Yeleyko 
Publication date: 18 May 2011
Abstract: We consider killed Markov decision processes for countable models on a finite time-interval. Existence of a uniform -optimal policy is proven. We show the correctness of the fundamental equation. The optimal control problem is reduced to a similar problem for the derived model. We receive an optimality equation and a method for the construction of simple optimal policies. The sufficiency of simple policies for countable models is proven. We show the correctness of the Markovian property. Additionally, a dynamic programming principle is considered.
Full work available at URL: https://arxiv.org/abs/1304.2495
Recommendations
- scientific article; zbMATH DE number 5946235
- scientific article; zbMATH DE number 140572
- Finite discrete time Markov chains with interval probabilities
- Nondiscounted Continuous Time Markovian Decision Process with Countable State Space
- Stochastic approximation of the paths of killed Markov processes conditioned on survival
- Finite-horizon piecewise deterministic Markov decision processes with unbounded transition rates
- Interval-valued finite Markov chains
- Markov decision processes with a stopping time constraint
- Assessment and optimal strategies of semi-continuous killed Markov decision processes
Cited In (3)
This page was built for publication: Killed Markov Decision Processes on Finite Time Interval for Countable Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000266)
