On the Complexity of Value Iteration

DOI10.4230/LIPIcs.ICALP.2019.102OpenAlexW2965309826MaRDI QIDQ5091264

Stefan Kiefer, Petr Novotný, Nikhil Balaji, Guillermo A. Pérez, Mahsa Shirmohammadi

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1807.04920

zbMATH Keywords

Markov decision processesformal verificationvalue iteration

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (2)

Value iteration for simple stochastic games: stopping criterion and learning algorithm ⋮ Comparison of algorithms for simple stochastic games

Cites Work

• Markov decision processes with applications to finance.
• Uniform constant-depth threshold circuits for division and iterated multiplication.
• Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs
• The Complexity of the Simplex Method
• Complexity of finite-horizon Markov decision process problems
• On the Complexity of Numerical Analysis
• The Complexity of Markov Decision Processes
• Handbook of Model Checking
• Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes
• A note on succinct representations of graphs
• Limit Synchronization in Markov Decision Processes
• The Complexity of Decentralized Control of Markov Decision Processes
• A survey of computational complexity results in systems and control
• Sound value iteration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Complexity of Value Iteration