A Survey of Stochastic Games with Limsup and Liminf Objectives

Authors:
Krishnendu Chatterjee;Laurent Doyen;Thomas A. Henzinger
Affiliations:
Institute of Science and Technology (IST), Austria;Université Libre de Bruxelles (ULB), Belgium;École Polytechnique Fédérale de Lausanne (EPFL), Switzerland
Venue:
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Year:
2009

Citing 8
Cited 1

The complexity of mean payoff games on graphs

Theoretical Computer Science
Competitive Markov decision processes

Competitive Markov decision processes
Languages, automata, and logic

Handbook of formal languages, vol. 3
Quantitative stochastic parity games

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Games where you can play optimally without any memory

CONCUR 2005 - Concurrency Theory
Value Iteration

25 Years of Model Checking
Quantitative Languages

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Probabilistic Systems with LimSup and LimInf Objectives

Infinity in Logic and Computation

Computational Aspects of Equilibria

SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We survey stochastic games with limsup and liminf objectives. A real-valued reward is assigned to each state, and the value of an infinite path is the limsup (resp. liminf) of all rewards along the path. The value of a stochastic game is the maximal expected value of an infinite path that can be achieved by resolving the decisions of the first player. We present the complexity of computing values of stochastic games and their subclasses, and the complexity of optimal strategies in such games.