Determinacy and optimal strategies in infinite-state stochastic reachability games (Q391114): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The determinacy of Blackwell games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualitative reachability in stochastic BPA games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Termination Value of One-Counter MDPs and Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualitative Reachability in Stochastic BPA Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3165947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4964719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability in recursive Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank

Latest revision as of 05:44, 7 July 2024

scientific article
Language Label Description Also known as
English
Determinacy and optimal strategies in infinite-state stochastic reachability games
scientific article

    Statements

    Determinacy and optimal strategies in infinite-state stochastic reachability games (English)
    0 references
    0 references
    10 January 2014
    0 references
    0 references
    stochastic games
    0 references
    reachability
    0 references
    determinacy
    0 references
    optimal strategies
    0 references
    0 references