---
res:
  bibo_abstract:
  - We consider concurrent games played on graphs. At every round of a game, each
    player simultaneously and independently selects a move; the moves jointly determine
    the transition to a successor state. Two basic objectives are the safety objective
    to stay forever in a given set of states, and its dual, the reachability objective
    to reach a given set of states. First, we present a simple proof of the fact that
    in concurrent reachability games, for all ε>0, memoryless ε-optimal strategies
    exist. A memoryless strategy is independent of the history of plays, and an ε-optimal
    strategy achieves the objective with probability within ε of the value of the
    game. In contrast to previous proofs of this fact, our proof is more elementary
    and more combinatorial. Second, we present a strategy-improvement (a.k.a. policy-iteration)
    algorithm for concurrent games with reachability objectives. Finally, we present
    a strategy-improvement algorithm for turn-based stochastic games (where each player
    selects moves in turns) with safety objectives. Our algorithms yield sequences
    of player-1 strategies which ensure probabilities of winning that converge monotonically
    (from below) to the value of the game. © 2012 Elsevier Inc.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Krishnendu
      foaf_name: Chatterjee, Krishnendu
      foaf_surname: Chatterjee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-4561-241X
  - foaf_Person:
      foaf_givenName: Luca
      foaf_name: De Alfaro, Luca
      foaf_surname: De Alfaro
  - foaf_Person:
      foaf_givenName: Thomas A
      foaf_name: Henzinger, Thomas A
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000−0002−2985−7724
  bibo_doi: 10.1016/j.jcss.2012.12.001
  bibo_issue: '5'
  bibo_volume: 79
  dct_date: 2013^xs_gYear
  dct_identifier:
  - UT:000316837300011
  dct_language: eng
  dct_publisher: Elsevier@
  dct_title: Strategy improvement for concurrent reachability and turn based stochastic
    safety games@
...