Comparison of algorithms for simple stochastic games
type: Item
instance of: scholarly article
title: Comparison of algorithms for simple stochastic games
author: Jan Křetínský
author: Emanuel Ramneantu
author: Alexander Slivinskiy
author: Maximilian Weininger
published in: Information and Computation
publication date: 2022-12-08T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7629166
zbMATH Keywords: formal methods
zbMATH Keywords: probabilistic verification
zbMATH Keywords: stochastic games
zbMATH Keywords: algorithms
zbMATH Keywords: value iteration
zbMATH Keywords: strategy iteration
zbMATH Keywords: quadratic programming
describes a project that uses: GIST
describes a project that uses: PRISM-games
describes a project that uses: GAVS
MaRDI profile type: Publication
full work available at URL: j.ic.2022.104885
OpenAlex ID: W4214829027
cites work: Approximating Values of Generalized-Reachability Stochastic Games
cites work: Q5322945
cites work: Ensuring the reliability of your model checker: interval iteration for Markov decision processes
cites work: On the Complexity of Value Iteration
cites work: Verification of Markov Decision Processes Using Learning Algorithms
cites work: Strategy improvement for concurrent reachability and turn-based stochastic safety games
cites work: Q4964720
cites work: Q5111270
cites work: Value Iteration
cites work: A survey of stochastic \(\omega \)-regular games
cites work: Stochastic games with lexicographic reachability-safety objectives
cites work: Model-Checking ω-Regular Properties of Interval Markov Chains
cites work: Automatic verification of competitive stochastic systems
cites work: On Stochastic Games with Multiple Objectives
cites work: The complexity of stochastic games
cites work: Q4287357
cites work: The complexity of probabilistic verification
cites work: Another sub-exponential algorithm for the simple stochastic game
cites work: Q3112630
cites work: Q4382287
cites work: Simple Stochastic Games with Few Random Vertices Are Easy to Solve
cites work: Interval iteration algorithm for MDPs and IMDPs
cites work: The complexity of solving reachability games using value and strategy iteration
cites work: Optimistic value iteration
cites work: On Nonterminating Stochastic Games
cites work: Solving Simple Stochastic Games with Few Coin Toss Positions
cites work: A game-based abstraction-refinement framework for Markov decision processes
cites work: Value iteration for simple stochastic games: stopping criterion and learning algorithm
cites work: The polynomial solvability of convex quadratic programming
cites work: Efficient Strategy Iteration for Mean Payoff in Markov Decision Processes
cites work: Q5875366
cites work: Q5021007
cites work: A subexponential randomized algorithm for the simple stochastic game problem
cites work: Widest paths and global propagation in bounded value iteration for stochastic games
cites work: Q4315289
cites work: Sound value iteration
cites work: Computationally Related Problems
cites work: New algorithms for solving simple stochastic games
cites work: Quantitative verification and strategy synthesis for stochastic games
cites work: The complexity of mean payoff games on graphs
DOI: 10.1016/J.IC.2022.104885
description: scientific article; zbMATH DE number 7629166