A Synchronous Updating Rule for Evolutionary Congestion Games Based on Common Information

In this paper, we propose a novel method for designing a synchronous strategy updating rule to guarantee the almost sure convergence of a Nash equilibrium in evolutionary congestion games. Different from much literature in which the full information of the game is used, in this paper, the information obtained by each player only contains the resource allocation of the last play which is sufficient to guarantee the convergence. The main idea is embedding the player’s time-varying inertia factor in the traditional myopic best response adjustment rule to improve the evolutionary dynamic. The developed theoretical results are simulated by solving a routing problem.