We present two new notions of evolutionary stability, the truly evolutionarily stable state (TESS) and the generalized evolutionarily stable equilibrium (GESE). The GESE generalizes the evolutionarily stable equilibrium (ESE) of Joosten [1996]. An ESE attracts all nearby trajectories...

We introduce a new kind of projection dynamics by employing a ray-projection both locally and globally. By global (local) we mean a projection of a vector (close to the unit simplex) unto the unit simplex along a ray through the origin. Using a correspondence between local and global...

We show that the playing sequence-the order in which players update their actions-is a crucial determinant of whether the best-response dynamic converges to a Nash equilibrium. Specifically, we analyze the probability that the best-response dynamic converges to a pure Nash equilibrium in random...

This paper provides an in-depth study of the (most) refined best reply correspondence introduced by Balkenborg, Hofbauer, and Kuzmics (2012). An example demonstrates that this correspondence can be very different from the standard best reply correspondence. In two-player games, however, the...

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

We present attractiveness, a refinement criterion for evolutionary equilibria. Equilibria surviving this criterion are robust to small perturbations of the underlying payoff system or the dynamics at hand. Furthermore, certain attractive equilibria are equivalent to others for certain...

Two individuals are involved in a conflict situation in which preferences are ex ante uncertain. While they eventually learn their own preferences, they have to pay a small cost if they want to learn their opponent's preferences. We show that, for sufficiently small positive costs of information...

We propose a learning dynamic with agents using samples of past play to estimate the distribution of other players' strategy choices and best responding to this estimate. To account for noisy play, estimated distributions over other players' strategy choices have full support in the other...

We analyze a game in which players with unique information are arranged in a hierarchy. In the lowest layer each player can decide in each of several rounds either to pass the information to his successor or to hold. While passing generates an immediate payoff according to the value of...

We apply the dynamic stochastic framework proposed by recent evolutionaryliterature to the class of strict supermodular games when two simplebehavior rules coexist in the population, imitation and myopic optimization.We assume that myopic optimizers are able to see how well their payoff...