Deterministic Approximation of Stochastic Evolution in Games

This paper provides deterministic approximation results for stochastic processes that arise when finite populations recurrently play finite games. The deterministic approximation is defined in continuous time as a system of ordinary differential equations of the type studied in evolutionary game theory. We establish precise connections between the long-run behavior of the stochastic process, for large populations, and its deterministic approximation. In particular, we show that if the deterministic solution through the initial state of the stochastic process at some point in time enters a basin of attraction, then the stochastic process will enter any given neighborhood of that attractor within a finite and deterministic time with a probability that exponentially approaches one as the population size goes to infinity. The process will remain in this neighborhood for a random time that almost surely exceeds an exponential function of the population size. During this time interval, the process spends almost all time at a certain subset of the attractor, its so-called Birkhoff center. We sharpen this result in the special case of ergodic processes.