Zero-sum random games on graphs.

Resumen:   We consider two adversary players that move in turn a token along the edges of some graph. Player 1 has to pay a random cost to Player 2 for each edge that is crossed by the token. We study the value of the game with average cost, when the duration goes to infinity, and establish a connection with oriented percolation.