This paper proposes the solution concept of interim correlated rationalizability, and shows that all types that have the same hierarchies of beliefs have the same set of interim-correlated-rationalizable outcomes. This solution concept characterizes common certainty of rationality in the...

We define and analyze a "strategic topology'' on types in the Harsanyi-Mertens-Zamir universal type space, where two types are close if their strategic behavior is similar in all strategic situations. For a fixed game and action define the distance between a pair of types as the difference...

Rationalizable partition-confirmed equilibrium (RPCE) describes the steady state outcomes of rational learning in extensive-form games, when rationality is common knowledge and players observe a partition of the terminal nodes. RPCE allows players to make inferences about unobserved play by...

We analyze a class of imitation dynamics with mutations for games with any finite number of actions, and give conditions for the selection of a unique equilibrium as the mutation rate becomes small and the population becomes large. Our results cover the multiple-action extensions of the...

We study models of learning in games where agents with limited memory use social information to decide when and how to change their play. When agents only observe the aggregate distribution of payoffs and only recall information from the last period, aggregate play comes close to Nash...

We study the perfect type-contingently public ex-post equilibrium (PTXE) of repeated games with incomplete information where players observe imperfect public signals of the actions and the map from actions to signal distributions is itself unknown. The PTXE payoffs when players are patient are...

The theory of learning in games explores how, which, and what kind of equilibria might arise as a consequence of a long-run nonequilibrium process of learning, adaptation, and/or imitation. If agents’ strategies are completely observed at the end of each round (and agents are randomly matched...

Stochastic fictitious play (SFP) assumes that agents do not try to influence the future play of their current opponents, an assumption that is justified by appeal to a setting with a large population of players who are randomly matched to play the game. However, the dynamics of SFP have only...