The complexity of solving reachability games using value and strategy iteration (Q2254503): Difference between revisions

From MaRDI portal
Merged Item from Q3007618
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Simple Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent reachability games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Concurrent Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of solving reachability games using value and strategy iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for solving stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of p-Equilibrium and Optimal Stationary Strategies in Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonterminating Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discounted and positive stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for discounted stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games / rank
 
Normal rank

Latest revision as of 04:49, 4 July 2024

scientific article; zbMATH DE number 5908672
  • The Complexity of Solving Reachability Games Using Value and Strategy Iteration
Language Label Description Also known as
English
The complexity of solving reachability games using value and strategy iteration
scientific article; zbMATH DE number 5908672
  • The Complexity of Solving Reachability Games Using Value and Strategy Iteration

Statements

The complexity of solving reachability games using value and strategy iteration (English)
0 references
The Complexity of Solving Reachability Games Using Value and Strategy Iteration (English)
0 references
0 references
0 references
5 February 2015
0 references
17 June 2011
0 references
0 references
0 references
0 references
0 references
0 references
0 references
concurrent reachability games
0 references
value iteration
0 references
strategy iteration
0 references
analysis of algorithms
0 references
0 references
0 references
0 references