We consider a basic stochastic evolutionary model with rare mutation and a best-reply (or better-reply) selection mechanism. Following Young's papers, we call a state stochastically stable if its long-term relative frequency of occurrence is bounded away from zero as the mutation rate decreases...

Sets closed under rational behavior were introduced by Basu and Weibull (1991) as subsets of the strategy space that contain all best replies to all strategy profiles in the set. We here consider a more restrictive notion of closure under rational behavior: a subset of the strategy space is...

It is shown that the n-player lottery contest admits a best-response potential (Voorneveld, 2000, Economics Letters). This is true also when the contest technology reflects the possibility of a draw. The result implies, in particular, the existence of a non-trivial two-player zero-sum game that...

In (Viossat, 2006, "The replicator dynamics does not lead to correlated equilibria", forthcoming in Games and Economic Behavior), it was shown that the replicator dynamics may eliminate all pure strategies used in correlated equilibrium, so that only strategies that do not take part in any...

Saez-Marti and Weibull [4] investigate the consequences of letting some agents play a myopic best reply to the myopic best reply in Young's [8] bargaining model. This is how they introduce "cleverness" of players. We analyze such clever agents in general finite two-player games. We show that...

A large number of individuals are randomly matched into groups, where each group plays a finite symmetric game. Individuals breed true. The expected number of surviving offspring depends on own material payoff, but may also, due to cooperative breeding and/or reproductive competition, depend on...

In this paper, I analyze stochastic adaptation in finite n-player games played by heterogeneous populations of myopic best repliers, better repliers and imitators. In each period, one individual from each of n populations, one for each player role, is drawn to play and chooses a pure strategy...

This paper studies the dynamic construction of a blockchain by competitive miners. In contrast to the literature, we assume a finite time horizon. Moreover, miners are rewarded for blocks that eventually become part of the longest chain. It is shown that popular mining strategies such as...

We prove that, in all finite generic extensive-form games of perfect information, a continuous-time best response dynamic always converges to a Nash equilibrium component. We show the robustness of convergence by an approximate best response dynamic: whatever the initial state and an allowed...

This paper provides two conditions of epistemic robustness, robustness to alternative best replies and robustness to non-best replies, and uses them to characterize variants of curb sets in finite games, including the set of rationalizable strategies. -- epistemic game theory ; epistemic...