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

I introduce a new framework to study environments with both structural and strategic uncertainty, different from Harsanyi's (1967-8) `Bayesian games', that allows a researcher to test the robustness of Nash predictions while maintaining certain desirable restrictions on players' beliefs. The...

Weinstein and Yildiz (Econometrica, 2007) have shown that only very weak predictions are robust to mispecifications of higher order beliefs. Whenever a type has multiple rationalizable actions, any of these actions is uniquely rationalizable for some arbitrarily close type. Hence, refinements of...

We investigate situations in which agents can communicate to each other only through a chain of intermediators, for example because they have to obey institutionalized communication protocols. We assume that all involved in the communication are strategic, and might want to influence the action...

This paper studies the existence of equilibrium solution concepts in a large class of economic models with discontinuous payoff functions. The issue is well understood for Nash equilibria, thanks to Reny’s better-reply security con- dition ( Reny 1999) and its recent improvements (Barelli and...

Rationalizability is a central concept in game theory. Since there may be many rationalizable strategies, applications commonly use refinements to obtain sharp predictions. In an important paper, Weinstein and Yildiz (2007) show that no refinement is robust to perturbations of high-order...

In the context of anonymous games (i.e., games where the payoff of a player is, apart from his/her own action, determined by the distribution of the actions made by the other players), we present a model in which, generically (in a precise sense), finite‐player games have strict pure strategy...

A game of incomplete information can be decomposed into a basic game and an information structure. The basic game defines the set of actions, the set of payoff states the payoff functions and the common prior over the payoff states. The information structure refers to the signals that the...

This paper elucidates the conceptual role that independent randomization plays in non-cooperative game theory. In the context of large (atomless) games in normal form, we present precise formalizations of the notions of a mixed strategy equilibrium (MSE), and of a randomized strategy equilibrium...