Risk-Sensitive and Average Optimality in Markov Decision Processes

被引:0
|
作者
Sladky, Karel [1 ]
机构
[1] Acad Sci Czech Republic, Inst Informat Theory & Automat, CR-18208 Prague 8, Czech Republic
关键词
dynamic programming; stochastic models; risk analysis and management; DYNAMIC-PROGRAMMING RECURSIONS; CHAINS;
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
This contribution is devoted to the risk-sensitive optimality criteria in finite state Markov Decision Processes. At first, we rederive necessary and sufficient conditions for average optimality of (classical) risk-neutral unichain models. This approach is then extended to the risk-sensitive case, i.e., when expectation of the stream of one-stage costs (or rewards) generated by a Markov chain is evaluated by an exponential utility function. We restrict ourselves on irreducible or unichain Markov models where risk-sensitive average optimality is independent of the starting state. As we show this problem is closely related to solution of (nonlinear) Poissonian equations and their connections with nonnegative matrices.
引用
收藏
页码:799 / 804
页数:6
相关论文
共 50 条