51 citations · 233 across the 33 of their papers we have counts for
8 papers · 1 filter
Sound Value Iteration for Simple Stochastic Games
Muqsit Azeem, Jan Kretinsky, Maximilian Weininger
Algorithmic analysis of Markov decision processes (MDP) and stochastic games (SG) in practice relies on value-iteration (VI) algorithms. Since basic VI does not provide guarantees…
Sound Value Iteration for Simple Stochastic Games
Muqsit Azeem, Jan Kretinsky, Maximilian Weininger
Algorithmic analysis of Markov decision processes (MDP) and stochastic games (SG) in practice relies on value-iteration (VI) algorithms. Since the basic version of VI does not prov…
Optimistic and Topological Value Iteration for Simple Stochastic Games
Muqsit Azeem, Alexandros Evangelidis, Jan Křetínský +2
While value iteration (VI) is a standard solution approach to simple stochastic games (SSGs), it suffered from the lack of a stopping criterion. Recently, several solutions have ap…
Stochastic Games with Disjunctions of Multiple Objectives
Tobias Winkler, Maximilian Weininger
Stochastic games combine controllable and adversarial non-determinism with stochastic behavior and are a common tool in control, verification and synthesis of reactive systems faci…
Comparison of Algorithms for Simple Stochastic Games
Jan Křetínský, Emanuel Ramneantu, Alexander Slivinskiy +1
Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strat…
Comparison of Algorithms for Simple Stochastic Games (Full Version)
Jan Kretinsky, Emanuel Ramneantu, Alexander Slivinskiy +1
Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strat…
Stochastic Games with Lexicographic Reachability-Safety Objectives
Krishnendu Chatterjee, Joost-Pieter Katoen, Maximilian Weininger +1
We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification,…
Approximating Values of Generalized-Reachability Stochastic Games
Pranav Ashok, Krishnendu Chatterjee, Jan Kretinsky +2
Simple stochastic games are turn-based 2.5-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a…