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...

Individuals belonging to two large populations are repeatedly randomly matched to play a cyclic "times" game such as Matching Pennies. Between matching rounds, individuals sometimes change their strategy after observing a finite sample of other outcomes within their population. Individuals from...

We call a correspondence, defined on the set of mixed strategy profiles, a generalized best reply correspondence if it has (1) a product structure, is (2) upper semi-continuous, (3) always includes a best reply to any mixed strategy profile, and is (4) convex- and closed-valued. For each...