656 search results - page 15 / 132 » Complexity of finite-horizon Markov decision process problem... |
112
click to vote
AMAI
2004
Springer
15 years 7 months ago
2004
Springer
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
132
Voted
COLT
2007
Springer
15 years 8 months ago
2007
Springer
Bounded parameter Markov Decision Processes (BMDPs) address the issue of dealing with uncertainty in the parameters of a Markov Decision Process (MDP). Unlike the case of an MDP, t...
161
Voted
NFM
2011
14 years 8 months ago
2011
Abstract. In parametric Markov Decision Processes (PMDPs), transition probabilities are not fixed, but are given as functions over a set of parameters. A PMDP denotes a family of ...
106
click to vote
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
— We consider decision-making problems in Markov decision processes where both the rewards and the transition probabilities vary in an arbitrary (e.g., nonstationary) fashion. We...
109
Voted
AIPS
2009
15 years 2 months ago
2009
Explaining policies of Markov Decision Processes (MDPs) is complicated due to their probabilistic and sequential nature. We present a technique to explain policies for factored MD...