Maximizing the probability of visiting a set infinitely often for a countable state space Markov decision process - Archive ouverte HAL Access content directly
Journal Articles Journal of Mathematical Analysis and Applications Year : 2022

Maximizing the probability of visiting a set infinitely often for a countable state space Markov decision process

(1, 2, 3, 4, 5) , (6)
1
2
3
4
5
6

Domains

Mathematics [math] Optimization and Control [math.OC]

François Dufour  : Connect in order to contact the contributor

https://hal.inria.fr/hal-03507261

Submitted on : Monday, January 3, 2022-10:58:19 AM

Last modification on : Wednesday, February 1, 2023-6:44:10 PM

Not file

Dates and versions

hal-03507261 , version 1 (03-01-2022)

Identifiers

Cite

François Dufour, Tomás Prieto-Rumeau. Maximizing the probability of visiting a set infinitely often for a countable state space Markov decision process. Journal of Mathematical Analysis and Applications, 2022, ⟨10.1016/j.jmaa.2021.125639⟩. ⟨hal-03507261⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS INRIA INSMI INRIA2 TDS-MACS
21 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More