---
res:
  bibo_abstract:
  - 'We consider concurrent mean-payoff games, a very well-studied class of two-player
    (player 1 vs player 2) zero-sum games on finite-state graphs where every transition
    is assigned a reward between 0 and 1, and the payoff function is the long-run
    average of the rewards. The value is the maximal expected payoff that player 1
    can guarantee against all strategies of player 2. We consider the computation
    of the set of states with value 1 under finite-memory strategies for player 1,
    and our main results for the problem are as follows: (1) we present a polynomial-time
    algorithm; (2) we show that whenever there is a finite-memory strategy, there
    is a stationary strategy that does not need memory at all; and (3) we present
    an optimal bound (which is double exponential) on the patience of stationary strategies
    (where patience of a distribution is the inverse of the smallest positive probability
    and represents a complexity measure of a stationary strategy).@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: Rasmus
      foaf_name: Ibsen-Jensen, Rasmus
      foaf_surname: Ibsen-Jensen
      foaf_workInfoHomepage: http://www.librecat.org/personId=3B699956-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0003-4783-0389
  bibo_doi: 10.1137/1.9781611973730.69
  bibo_issue: '1'
  bibo_volume: 2015
  dct_date: 2015^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/978-161197374-7
  dct_language: eng
  dct_publisher: SIAM@
  dct_title: The value 1 problem under finite-memory strategies for concurrent mean-payoff
    games@
...