CONDITIONS FOR EQUIVALENCE OF OPTIMALITY CRITERIA IN DYNAMIC-PROGRAMMING

被引:15
作者
FLYNN, J [1 ]
机构
[1] UNIV CHICAGO,CHICAGO,IL 60637
关键词
D O I
10.1214/aos/1176343590
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
引用
收藏
页码:936 / 953
页数:18
相关论文
共 18 条
[1]  
Blackwell D., 1965, ANN MATH STAT, V36, P226
[2]   ON THE ITERATIVE METHOD OF DYNAMIC-PROGRAMMING ON A FINITE SPACE DISCRETE-TIME MARKOV PROCESS [J].
BROWN, BW .
ANNALS OF MATHEMATICAL STATISTICS, 1965, 36 (04) :1279-1285
[3]  
Chung K. L., 1960, MARKOV CHAINS STATIO
[4]   AN OPTIMALITY CONDITION FOR DISCRETE DYNAMIC PROGRAMMING WITH NO DISCOUNTING [J].
DENARDO, EV ;
MILLER, BL .
ANNALS OF MATHEMATICAL STATISTICS, 1968, 39 (04) :1220-&
[5]   A SOLUTION TO A COUNTABLE SYSTEM OF EQUATIONS ARISING IN MARKOVIAN DECISION PROCESSES [J].
DERMAN, C ;
VEINOTT, AF .
ANNALS OF MATHEMATICAL STATISTICS, 1967, 38 (02) :582-&
[6]   DENUMERABLE STATE MARKOVIAN DECISION PROCESSES - AVERAGE COST CRITERION [J].
DERMAN, C .
ANNALS OF MATHEMATICAL STATISTICS, 1966, 37 (06) :1545-&
[7]   ON SEQUENTIAL CONTROL PROCESSES [J].
DERMAN, C .
ANNALS OF MATHEMATICAL STATISTICS, 1964, 35 (01) :341-&
[8]  
Doob J. L., 1953, STOCHASTIC PROCESSES, V101
[9]   AVERAGING VS DISCOUNTING IN DYNAMIC-PROGRAMMING - COUNTEREXAMPLE [J].
FLYNN, J .
ANNALS OF STATISTICS, 1974, 2 (02) :411-413
[10]  
HOBSON EW, 1926, THEORY FUNCTIONS REA