Shapley's discounted stochastic games, Everett's recursive games and Gillette's
undiscounted stochastic games are classical models of game theory describing two-player …

Probabilistic model checking mainly concentrates on techniques for reasoning about the
probabilities of certain path properties or expected values of certain random variables. For …

Stochastic games have an element of chance: the state of the next round is determined
probabilistically depending upon players' actions and the current state. Successful players …

Zero-sum stochastic games, henceforth stochastic games, are a classical model in game
theory in which two opponents interact and the environment changes in response to the …

We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state
graph. We focus on the important sub-class of ergodic games where all states are visited …

We study two-player zero-sum concurrent stochastic games with finite state and action
space played for an infinite number of steps. In every step, the two players simultaneously …

We consider concurrent games played by two players on a finite-state graph, where in every
round the players simultaneously choose a move, and the current state along with the joint …

We show that the value of a finite-state concurrent reachability game can be approximated to
arbitrary precision in TFNP [NP], that is, in the polynomial time hierarchy. Previously, no …

Two standard algorithms for approximately solving two-player zero-sum concurrent
reachability games are value iteration and strategy iteration. We prove upper and lower …

We consider two player, zero-sum, finite-state concurrent reachability games, played for an
infinite number of rounds, where in every round, each player simultaneously and …