Stochastic Games with Branching-Time Winning Objectives

We consider random-turn positional games, introduced by Peres, Schramm, Sheffield, and Wilson in 2007. A p-random-turn positional game is a two-player game, played the same as an ordinary positional game, except that instead of alternating turns, a coin ...

We consider two-player stochastic games played on a finite graph for infinitely many rounds. Stochastic games generalize both Markov decision processes (MDP) by adding an adversary player, and two-player deterministic games by adding stochasticity. The ...

In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. These types of problems were studied earlier for Maker-Breaker games; here ...