CONNECTEDNESS CONDITIONS USED IN FINITE STATE MARKOV DECISION-PROCESSES

被引:2
作者
THOMAS, LC
机构
[1] Department of Decision Theory, University of Manchester, Manchester
关键词
D O I
10.1016/0022-247X(79)90135-5
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This note considers the conditions that have been put on the set of transition matrices of finite state Markov Decision Processes in order to prove the existence of optimal policies, and the convergence of algorithms. It is shown that no two of the nine conditions considered are equivalent. © 1979.
引用
收藏
页码:548 / 556
页数:9
相关论文
共 50 条
[21]   APPROXIMATING THE MARKOV PROPERTY IN MARKOV DECISION-PROCESSES [J].
WHITE, DJ .
INFORMATION AND DECISION TECHNOLOGIES, 1989, 15 (03) :147-162
[22]   REAL APPLICATIONS OF MARKOV DECISION-PROCESSES [J].
WHITE, DJ .
INTERFACES, 1985, 15 (06) :73-83
[25]   SUFFICIENT STATISTICS FOR MARKOV DECISION-PROCESSES [J].
BATHER, JA .
ADVANCES IN APPLIED PROBABILITY, 1978, 10 (02) :307-308
[26]   MARKOV DECISION-PROCESSES - PUTERMAN,ML [J].
ORMAN, A .
INTERFACES, 1995, 25 (02) :93-94
[29]   MARKOV DECISION-PROCESSES WITH MULTIPLE COSTS [J].
GHOSH, MK .
OPERATIONS RESEARCH LETTERS, 1990, 9 (04) :257-260
[30]   MARKOV DECISION-PROCESSES AND REGULAR EVENTS [J].
COURCOUBETIS, C ;
YANNAKAKIS, M .
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 443 :336-349