This note establishes that in every 3-3 symmetric game, the replicator dynamics eliminates all strategies that are never used in correlated equilibrium. This extends to the best-response dynamics and to any convex monotonic dynamics. The proof is based on dual reduction.

We show on a 4x4 example that many dynamics may eliminate all strategies used in correlated equilibria, and this for an open set of games. This holds for the best-response dynamics, the Brown-von Neumann-Nash dynamics and any monotonic or weakly sign-preserving dynamics satisfying some standard...

Do evolutionary processes lead economic or biological agents to behave as if they were rational? To test this idea, many authors examined whether evolutionary game dynamics eliminate strictly dominated strategies. We survey, unify, and fill some gaps in this literature in the case of monotonic...

It is shown that, under the replicator dynamics, all strategies played in correlated equilibrium may be eliminated, so that only strategies with zero marginal probability in all correlated equilibria survive. This occurs in particular in a family of 4×4 games built by adding a strategy to a...

If a game has a unique Nash equilibrium, then this equilibrium is arguably the solution of the game from the refinement's literature point of view. However, it might be that for almost all initial conditions, all strategies in the support of this equilibrium are eliminated by the replicator...

We study dual reduction: a technique to reduce finite games in a way that selects among correlated equilibria. We show that the reduction process is independent of the utility functions chosen to represent the agents's preferences and that generic two-player games have a unique full dual...

Using an explicit representation in terms of the logit map we show, in a unilateral framework, that the time average of the replicator dynamics is a perturbed solution of the best reply dynamics.

We study the structure of the set of equilibrium payoffs in finite games, both for Nash equilibrium and correlated equilibrium. A nonempty subset of R^2 is shown to be the set of Nash equilibrium payoffs of a bimatrix game if and only if it is a finite union of rectangles. Furthermore, we show...

The dual reduction process, introduced by Myerson, allows a finite game to be reduced to a smaller-dimensional game such that any correlated equilibrium of the reduced game is an equilibrium of the original game. We study the properties and applications of this process. It is shown that generic...

We investigate whether having a unique equilibrium (or a given number of equilibria) is robust to perturbation of the payoffs, both for Nash equilibrium and correlated equilibrium. We show that the set of n-player finite games with a unique correlated equilibrium is open, while this is not true...