Paper: Stochastic Games with Branching-Time Winning Objectives (at LICS 2006)

Authors: Tomáš Brázdil Václav Brozek Vojtech Forejt Antonín Kučera

Abstract

We consider stochastic turn-based games where the winning objectives are given by formulae of the branching-time logic PCTL. These games are generally not determined and winning strategies may require memory and/or randomization. Our main results concern history-dependent strategies.

BibTeX

  @InProceedings{BrazdilBrozekForejt-StochasticGameswith,
    author = 	 {Tomáš Brázdil and Václav Brozek and Vojtech Forejt and Antonín Kučera},
    title = 	 {Stochastic Games with Branching-Time Winning Objectives},
    booktitle =  {Proceedings of the Twenty-First Annual IEEE Symposium on Logic in Computer Science (LICS 2006)},
    year =	 {2006},
    month =	 {August}, 
    pages =      {349--358},
    location =   {Seattle, Washington, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }