Optimistic and topological value iteration for simple stochastic games
From MaRDI portal
Publication:6160920
DOI10.1007/978-3-031-19992-9_18zbMath1522.68295arXiv2207.14417OpenAlexW4312411454MaRDI QIDQ6160920
Alexandros Evangelidis, Maximilian Weininger, Muqsit Azeem, Jan Křetínský, Alexander Slivinskiy
Publication date: 2 June 2023
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.14417
Games involving graphs (91A43) Applications of game theory (91A80) Stochastic games, stochastic differential games (91A15) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantitative verification and strategy synthesis for stochastic games
- The complexity of stochastic games
- Robot motion planning: A game-theoretic foundation
- Ensuring the reliability of your model checker: interval iteration for Markov decision processes
- Widest paths and global propagation in bounded value iteration for stochastic games
- Optimistic value iteration
- Automatic verification of competitive stochastic systems
- Interval iteration algorithm for MDPs and IMDPs
- Value iteration for simple stochastic games: stopping criterion and learning algorithm
- Verification of Markov Decision Processes Using Learning Algorithms
- Value Iteration
- The Complexity of Solving Stochastic Games on Graphs
- On Nonterminating Stochastic Games
- Sound value iteration
This page was built for publication: Optimistic and topological value iteration for simple stochastic games