scholarly journals Verification of General Markov Decision Processes by Approximate Similarity Relations and Policy Refinement

2017 ◽  
Vol 55 (4) ◽  
pp. 2333-2367 ◽  
Author(s):  
Sofie Haesaert ◽  
Sadegh Esmaeil Zadeh Soudjani ◽  
Alessandro Abate
1983 ◽  
Vol 20 (04) ◽  
pp. 835-842
Author(s):  
David Assaf

The paper presents sufficient conditions for certain functions to be convex. Functions of this type often appear in Markov decision processes, where their maximum is the solution of the problem. Since a convex function takes its maximum at an extreme point, the conditions may greatly simplify a problem. In some cases a full solution may be obtained after the reduction is made. Some illustrative examples are discussed.


Sign in / Sign up

Export Citation Format

Share Document