scientific article; zbMATH DE number 7455745

MaRDI QIDQ5021007

Alexander Slivinskiy, Maximilian Weininger, Jan Křetínský, Emanuel Ramneantu

Publication date: 11 January 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Value iteration for simple stochastic games: stopping criterion and learning algorithm ⋮ Symbolic verification and strategy synthesis for turn-based stochastic games ⋮ Optimistic and topological value iteration for simple stochastic games ⋮ Comparison of algorithms for simple stochastic games

Uses Software

• GAVS
• GIST
• PRISM-games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantitative verification and strategy synthesis for stochastic games
• Strategy improvement for concurrent reachability and turn-based stochastic safety games
• A survey of stochastic \(\omega \)-regular games
• A game-based abstraction-refinement framework for Markov decision processes
• Another sub-exponential algorithm for the simple stochastic game
• The complexity of stochastic games
• The complexity of mean payoff games on graphs
• A subexponential randomized algorithm for the simple stochastic game problem
• Ensuring the reliability of your model checker: interval iteration for Markov decision processes
• Optimistic value iteration
• The complexity of solving reachability games using value and strategy iteration
• Interval iteration algorithm for MDPs and IMDPs
• On Stochastic Games with Multiple Objectives
• Solving Simple Stochastic Games with Few Coin Toss Positions
• Verification of Markov Decision Processes Using Learning Algorithms
• Value Iteration
• The polynomial solvability of convex quadratic programming
• The complexity of probabilistic verification
• Efficient Strategy Iteration for Mean Payoff in Markov Decision Processes
• Approximating Values of Generalized-Reachability Stochastic Games
• Simple Stochastic Games with Few Random Vertices Are Easy to Solve
• Model-Checking ω-Regular Properties of Interval Markov Chains
• On Nonterminating Stochastic Games
• Value iteration for simple stochastic games: stopping criterion and learning algorithm
• Sound value iteration
• PAC statistical model checking for Markov decision processes and stochastic games

This page was built for publication: