Strong 0-discount optimal policies in a Markov decision process with a Borel state space (Q4845096): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Discrete Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong 1-optimal stationary policies in denumerable Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5822308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation and control in Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Discounted Denumerable Markovian Decision Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Dynamic Programming with Sensitive Discount Optimality Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blackwell optimal policies in a Markov decision process with a Borel state space / rank
 
Normal rank

Latest revision as of 17:05, 23 May 2024

scientific article; zbMATH DE number 792550
Language Label Description Also known as
English
Strong 0-discount optimal policies in a Markov decision process with a Borel state space
scientific article; zbMATH DE number 792550

    Statements

    Strong 0-discount optimal policies in a Markov decision process with a Borel state space (English)
    0 references
    0 references
    4 September 1995
    0 references
    0 references
    discrete time
    0 references
    Borel state space
    0 references
    countable action space
    0 references
    finite action sets
    0 references
    bounded rewards
    0 references
    Doeblin condition
    0 references
    stationary strong 0-discount optimal policies
    0 references