Zero-sum random games on directed graphs Attia, Luc Lichev, Lyuben Mitsche, Dieter Saona Urmeneta, Raimundo J ; https://orcid.org/0000-0001-5103-038X Ziliotto, Bruno 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. Starting from a fixed vertex, players take turns to move a token along the edges of the graph. On 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. On 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. 2024 info:eu-repo/semantics/preprint doc-type:preprint text http://purl.org/coar/resource_type/c_816b https://research-explorer.ista.ac.at/record/17101 Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. Zero-sum random games on directed graphs. <i>arXiv</i>. doi:<a href="https://doi.org/10.48550/arXiv.2401.16252">10.48550/arXiv.2401.16252</a> eng info:eu-repo/semantics/altIdentifier/doi/10.48550/arXiv.2401.16252 info:eu-repo/semantics/altIdentifier/arxiv/2401.16252 info:eu-repo/semantics/openAccess