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 show the existence of a pure strategy, symmetric, increasing equilibrium in double auction markets with correlated private valuations and many participants. The equilibrium we find is arbitrarily close to fully revealing as the market size grows. Our results provide strategic foundations for...

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

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

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