Value Iteration

DOI10.1007/978-3-540-69850-0_7zbMATH Open1143.68042OpenAlexW2914135999MaRDI QIDQ3512436FDOQ3512436

Authors: Krishnendu Chatterjee, Thomas A. Henzinger 

Publication date: 15 July 2008

Published in: 25 Years of Model Checking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69850-0_7

Recommendations

• Reachability in MDPs: refining convergence of value iteration
• Sound value iteration
• Interval iteration algorithm for MDPs and IMDPs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• The complexity of stochastic games
• The complexity of mean payoff games on graphs
• Solving H-horizon, stationary Markov decision problems in time proportional to log (H)
• Stochastic Games
• Alternating-time temporal logic
• The complexity of probabilistic verification
• Title not available (Why is that?)
• Stochastic games
• A characterization of the minimum cycle mean in a digraph
• Quantitative solution of omega-regular games
• Title not available (Why is that?)
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
• Quantitative stochastic parity games
• Stochastic Games with Perfect Information and Time Average Payoff
• Title not available (Why is that?)
• Title not available (Why is that?)
• A deterministic subexponential algorithm for solving parity games
• Reduction of stochastic parity to stochastic mean-payoff games
• Title not available (Why is that?)
• The complexity of quantitative concurrent parity games
• Stochastic limit-average games are in EXPTIME
• Title not available (Why is that?)
• Discounting infinite games but how and why?
• Concurrent Games with Tail Objectives

Cited In (27)

• Comparison of algorithms for simple stochastic games
• Comparison of algorithms for simple stochastic games
• Sound value iteration
• Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
• Widest paths and global propagation in bounded value iteration for stochastic games
• Symbolic verification and strategy synthesis for turn-based stochastic games
• Expected reachability-time games
• Optimistic and topological value iteration for simple stochastic games
• Reachability in MDPs: refining convergence of value iteration
• On the Complexity of Value Iteration
• Automatic verification of concurrent stochastic systems
• Interval iteration algorithm for MDPs and IMDPs
• Quantitative verification and strategy synthesis for stochastic games
• Least-violating symbolic controller synthesis for safety, reachability and attractivity specifications
• Stochastic window mean-payoff games
• Stochastic games with disjunctions of multiple objectives
• Value iteration for simple stochastic games: stopping criterion and learning algorithm
• Entropic risk for turn-based stochastic games
• Exact quantitative probabilistic model checking through rational search
• Topological value iteration algorithms
• Automatic verification of competitive stochastic systems
• A practitioner's guide to MDP model checking algorithms
• Correct probabilistic model checking with floating-point arithmetic
• Correlated equilibria and fairness in concurrent stochastic games
• Equilibria-based probabilistic model checking for concurrent stochastic games
• Symbolic model checking in non-Boolean domains
• Title not available (Why is that?)

This page was built for publication: Value Iteration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512436)