Please use this identifier to cite or link to this item: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/7102
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBISWAS, ANUPen_US
dc.contributor.authorPRADHAN, SOMNATHen_US
dc.date.accessioned2022-06-16T04:23:35Z
dc.date.available2022-06-16T04:23:35Z
dc.date.issued2022-06en_US
dc.identifier.citationEsaim-Control Optimisation and Calculus Of Variations, 28, 26.en_US
dc.identifier.issn1292-8119en_US
dc.identifier.issn1262-3377en_US
dc.identifier.urihttps://doi.org/10.1051/cocv/2022018en_US
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/7102
dc.description.abstractWe consider a large family of discrete and continuous time controlled Markov processes and study an ergodic risk-sensitive minimization problem. Under a blanket stability assumption, we provide a complete analysis to this problem. In particular, we establish uniqueness of the value function and verification result for optimal stationary Markov controls, in addition to the existence results. We also revisit this problem under a near-monotonicity condition but without any stability hypothesis. Our results also include policy improvement algorithms both in discrete and continuous time frameworks.en_US
dc.language.isoenen_US
dc.publisherEDP Sciencesen_US
dc.subjectRisk-sensitive controlen_US
dc.subjectErgodic cost criterionen_US
dc.subjectStochastic representationen_US
dc.subjectVerification resulten_US
dc.subjectMarkov decision problemen_US
dc.subjectNear-monotone costen_US
dc.subject2022-JUN-WEEK3en_US
dc.subjectTOC-JUN-2022en_US
dc.subject2022en_US
dc.titleErgodic risk-sensitive control of Markov processes on countable state space revisiteden_US
dc.typeArticleen_US
dc.contributor.departmentDept. of Mathematicsen_US
dc.identifier.sourcetitleEsaim-Control Optimisation and Calculus Of Variationsen_US
dc.publication.originofpublisherForeignen_US
Appears in Collections:JOURNAL ARTICLES

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.