We examine the connection between discrete-time models of financial markets and the celebrated Black--Scholes--Merton (BSM) continuous-time model in which ''markets are complete." Suppose that (a) the probability law of a sequence of discrete-time models converges to the law of the BSM model and...

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

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

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 de.ne 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 .xed game and action de.ne the distance be-tween a pair of types as the diþerence between...

We study learning and information acquisition by a Bayesian agent whose prior belief is misspecified in the sense that it assigns probability 0 to the true state of the world. At each instant, the agent takes an action and observes the corresponding payoff, which is the sum of a fixed but...

We examine games played by a single large player and a large number of opponents who are small, but not anonymous. If the play of the small players is observed with noise, and if the number of actions the large player controls is bounded independently of the number of small players, then as 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...