We study a class of population games called stable games. These games are characterized by self-defeating externalities: when agents revise their strategies, the improvements in the payoffs of strategies to which revising agents are switching are always exceeded by the improvements in the...

We introduce a class of evolutionary game dynamics - pairwise comparison dynamics - under which revising agents choose a candidate strategy at random, switching to it with positive probability if and only if its payoff is higher than the agent’s current strategy. We prove that all such...

Brown and von Neumann introduced a dynamical system that converges to saddle points of zero sum games with finitely many strategies. Nash used the mapping underlying these dynamics to prove existence of equilibria in general games. The resulting Brown-von Neumann-Nash dynamics are a benchmark...

We propose a new concept for the analysis of games, the TASP, which gives a precise prediction about non-equilibrium play in games whose Nash equilibria are mixed and are unstable under fictitious play-like learning. We show that, when players learn using weighted stochastic fictitious play and...