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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
The Complexity of Solving Reachability Games Using Value and Strategy Iteration
description / endescription / en
scientific article
scientific article; zbMATH DE number 5908672
Property / title
 
The Complexity of Solving Reachability Games Using Value and Strategy Iteration (English)
Property / title: The Complexity of Solving Reachability Games Using Value and Strategy Iteration (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1330.68112 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-20712-9_7 / rank
 
Normal rank
Property / published in
 
Property / published in: Computer Science – Theory and Applications / rank
 
Normal rank
Property / publication date
 
17 June 2011
Timestamp+2011-06-17T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 17 June 2011 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A80 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5908672 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2567760784 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1875723089 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1007.1812 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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