Skip to search formSkip to main contentSkip to account menu

Markov decision process

Known as: Value iteration, Policy iteration, Markov decision problems 
Markov decision processes (MDPs) provide a mathematical framework for modeling decision making in situations where outcomes are partly random and… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Thank you very much for downloading markov decision processes with their applications. Maybe you have knowledge that, people have… 
2012
2012
In this paper we study the complexity of computing the game bisimulation metric defined by de Alfaro et al. on Markov Decision… 
2008
2008
This paper proposes hybrid ARQ-random network coding frameworks for real-time media broadcast over single-hop wireless networks… 
Highly Cited
2003
Highly Cited
2003
This thesis is divided into two separate parts. The first part is about Dynamic Programming for non-trivial optimal control… 
2003
2003
In this paper, we consider the model that the information on the rewards in vector-valued Markov decision processes includes… 
2002
2002
Markov Decision Processes (MDPs) [7] have developed lately as a standard method for representing uncertainty in decision… 
1997
1997
The computational complexity of finite horizon policy evaluation and policy existence problems are studied for several policy… 
1986
1986
In Markov decision theory we distinguish (a) discrete-time Markov decision processes (b) semi-Markov decision… 
1984
1984
This paper presents a successive approximation method for solving systems of nested functional equations which arise, e.g., when… 
1969
1969
A recently-developed perturbation formalism for finite Markov chains is used here to analyze the policy iteration algorithm for…