We study deterministic games of infinite duration played on graphs and focus on the strategy
complexity of quantitative objectives. Such games are known to admit optimal memoryless …

We study two-player reachability games on finite graphs. At each state the interaction
between the players is concurrent and there is a stochastic Nature. Players also play …

We study 2-player concurrent stochastic B\" uchi games on countable graphs. Two players,
Max and Min, seek respectively to maximize and minimize the probability of visiting a set of …

Abstract “Strong-cyclic policies” were introduced to formalize trial-and-error strategies and
are known to work in Markovian stochastic domains, ie, they guarantee that the goal is …

We study countably infinite stochastic 2-player games with reachability objectives. Our
results provide a complete picture of the memory requirements of ε-optimal (resp. optimal) …

The Transience objective is not to visit any state infinitely often. While this is not possible in
finite Markov Decision Process (MDP), it can be satisfied in countably infinite ones, eg, if the …

We study countably infinite Markov decision processes (MDPs) with real-valued transition
rewards. Every infinite run induces the following sequences of payoffs: 1. Point payoff (the …

We study countably infinite Markov decision processes (MDPs) with real-valued transition
rewards. Every infinite run induces the following sequences of payoffs: 1. Point payoff (the …

This article is a tutorial introduction to stochastic games, first introduced by Shapley in 1953.
The presentation is based around several classical examples of such games, and focusses …

This paper considers the problem of finding strategies that satisfy a mixture of sure and
threshold objectives in Markov decision processes. We focus on a single ω-regular objective …