Value Iteration

DOI10.1007/978-3-540-69850-0_7MaRDI QIDQ3512436zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

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

Cited in

(27)

• Comparison of algorithms for simple stochastic games
• Comparison of algorithms for simple stochastic games
• Widest paths and global propagation in bounded value iteration for stochastic games
• Sound value iteration
• Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
• Expected reachability-time games
• Symbolic verification and strategy synthesis for turn-based stochastic games
• Reachability in MDPs: refining convergence of value iteration
• Optimistic and topological value iteration for simple stochastic games
• 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
• Symbolic model checking in non-Boolean domains
• 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
• scientific article; zbMATH DE number 522741 (Why is no real title available?)

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)