On the stability of the logit dynamics in population games
Leonardo Cianfanelli, Giacomo Como
TL;DR
This work analyzes the asymptotic stability of the logit evolutionary dynamics in population games, addressing how stability changes with the noise level $\eta$ and the implications of multiple strict Nash equilibria. It proves that strict Nash equilibria are locally asymptotically stable for low noise, while there exists a globally exponentially stable logit equilibrium for sufficiently high noise; in addition, it identifies a broad class of monotone separable games that admit global asymptotic stability for every $\eta>0$, with a continuous curve of logit equilibria connecting Nash equilibria in the vanishing-noise limit to a uniform distribution in the high-noise limit. The monotone separable condition is shown to include heterogeneous routing scenarios, particularly on series compositions of parallel networks, yielding global stability even when no potential function exists. Collectively, the results reveal noise-induced bifurcations in population games with multiple strict equilibria and broaden the spectrum of games where logit dynamics are globally stable, providing theoretical justifications for observed routing and coordination phenomena under stochastic decision-making.
Abstract
We study the asymptotic stability of the logit evolutionary dynamics in population games, possibly with multiple heterogenous populations. For general population games, we prove that, on the one hand, strict Nash equilibria are asymptotically stable under the logit dynamics for low enough noise levels, on the other hand, a globally exponentially stable logit equilibrium exists for sufficiently large noise levels. This suggests the emergence of bifurcations in population games admitting multiple strict Nash equilibria, as observed in numerous examples. We then provide sufficient conditions on the population game structure for the existence of globally asymptotically stable logit equilibria for every noise level. The considered class of monotone separable games finds applications, e.g., in routing games on series compositions of networks with parallel routes when there are multiple populations of users that differ in the reward functions.
