Maximizing the probability of visiting a set infinitely often for a Markov decision process - Archive ouverte HAL
Pré-Publication, Document De Travail (Working Paper) Année : 2022

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

Domaines

Mathématiques [math]

Francois Dufour  : Connectez-vous pour contacter le contributeur

https://hal.science/hal-03853326

Soumis le : mardi 15 novembre 2022-12:35:15

Dernière modification le : mercredi 13 novembre 2024-09:10:03

Fichier non déposé

Dates et versions

hal-03853326 , version 1 (15-11-2022)

Identifiants

  • HAL Id : hal-03853326 , version 1

Citer

François Dufour, Tomás Prieto-Rumeau. Maximizing the probability of visiting a set infinitely often for a Markov decision process. 2022. ⟨hal-03853326⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INRIA IMB INSMI INRIA2
51 Consultations
0 Téléchargements

Partager

More