Algorithmical complexity of some statistical decision processes. I
Jan Šindelář (1980)
Kybernetika
Similarity:
Jan Šindelář (1980)
Kybernetika
Similarity:
Albert Pérez (1970)
Kybernetika
Similarity:
C.C. Heyde (1997)
Metrika
Similarity:
H. Heckendorff (1980)
Banach Center Publications
Similarity:
K. Krickeberg (1988)
Metrika
Similarity:
Vasile Preda (1981)
Colloquium Mathematicae
Similarity:
L. Vostrikova (1989-1990)
Publications mathématiques et informatique de Rennes
Similarity:
Xiaolong Zou, Xianping Guo (2015)
Kybernetika
Similarity:
In this paper we give a new set of verifiable conditions for the existence of average optimal stationary policies in discrete-time Markov decision processes with Borel spaces and unbounded reward/cost functions. More precisely, we provide another set of conditions, which only consists of a Lyapunov-type condition and the common continuity-compactness conditions. These conditions are imposed on the primitive data of the model of Markov decision processes and thus easy to verify. We also...