On polynomial cases of the unichain classification problem for Markov decision processes (Q957336): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal decision procedures for finite Markov chains. Part III: General convex systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Node Visitation in Stochastic Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state Markovian decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3237805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control of diffusion processes with reflection / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of checking the unichain condition in average cost MDPs / rank
 
Normal rank

Latest revision as of 21:29, 28 June 2024

scientific article
Language Label Description Also known as
English
On polynomial cases of the unichain classification problem for Markov decision processes
scientific article

    Statements

    On polynomial cases of the unichain classification problem for Markov decision processes (English)
    0 references
    0 references
    0 references
    27 November 2008
    0 references
    0 references
    Markov decision process
    0 references
    unichain condition
    0 references
    recurrent state
    0 references
    0 references