---
res:
  bibo_abstract:
  - "This paper considers a class of two-player zero-sum games on directed graphs
    whose vertices are equipped with random payoffs of bounded support known by both
    players.\r\nStarting from a fixed vertex, players take turns to move a token along
    the edges of the graph.\r\nOn the one hand, for acyclic directed graphs of bounded
    degree and sub-exponential expansion, we show that the value of the game converges
    almost surely to a constant at an exponential rate dominated in terms of the expansion.\r\nOn
    the other hand, for the infinite d-ary tree that does not fall into the previous
    class of graphs, we show convergence at a double-exponential rate in terms of
    the expansion.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Luc
      foaf_name: Attia, Luc
      foaf_surname: Attia
  - foaf_Person:
      foaf_givenName: Lyuben
      foaf_name: Lichev, Lyuben
      foaf_surname: Lichev
  - foaf_Person:
      foaf_givenName: Dieter
      foaf_name: Mitsche, Dieter
      foaf_surname: Mitsche
  - foaf_Person:
      foaf_givenName: Raimundo J
      foaf_name: Saona Urmeneta, Raimundo J
      foaf_surname: Saona Urmeneta
      foaf_workInfoHomepage: http://www.librecat.org/personId=BD1DF4C4-D767-11E9-B658-BC13E6697425
    orcid: 0000-0001-5103-038X
  - foaf_Person:
      foaf_givenName: Bruno
      foaf_name: Ziliotto, Bruno
      foaf_surname: Ziliotto
  bibo_doi: 10.48550/arXiv.2401.16252
  dct_date: 2024^xs_gYear
  dct_language: eng
  dct_title: Zero-sum random games on directed graphs@
...