We analyze games of incomplete information and offer equilibrium predictions which are valid for, and in this sense robust to, all possible private information structures that the agents may have. We completely characterize the set of Bayes correlated equilibria in a class of games with...

We define a notion of correlated equilibrium for games with incomplete information in a general setting with finite players, finite actions, and finite states, which we call Bayes correlated equilibrium. The set of Bayes correlated equilibria of a fixed incomplete information game equals the set...

We analyze games of incomplete information and offer equilibrium predictions which are valid for all possible private information structures that the agents may have. Our characterization of these robust predictions relies on an epistemic result which establishes a relationship between the set...

A universal type space of interdependent expected utility preference types is constructed from higher-order preference hierarchies describing (i) an agent's (unconditional) preferences over a lottery space; (ii) the agent's preference over Anscombe-Aumann acts conditional on the unconditional...

We consider the implementation of social choice functions under complete information in rationalizable strategies. A strict (and thus stronger) version of the monotonicity condition introduced by Maskin (1999) is necessary under the solution concept of rationalizability. Assuming the social...

In a general interdependent preference environment, we characterize when two payoff types can be distinguished by their rationalizable strategic choices without any prior knowledge of their beliefs and higher order beliefs. We show that two types are strategically distinguishable if and only if...

The set of outcomes that can arise in Bayes Nash equilibria of an incomplete information game where players may or may not have access to more private information is characterized and shown to be equivalent to the set of an incomplete information version of correlated equilibrium, which we call...

We define and characterize a notion of correlated equilibrium for games with incomplete information, which we call Bayes correlated equilibrium: The set of outcomes that can arise in Bayes Nash equilibria of an incomplete information game where players may have access to additional signals...

We propose an incomplete information analogue of rationalizability. An action is said to be belief-free rationalizable if it survives the following iterated deletion process. At each stage, we delete actions for a type of a player that are not a best response to some conjecture that puts weight...

The set of outcomes that can arise in Bayes Nash equilibria of an incomplete information game where players may have access to additional signals beyond the given information structure is equivalent to the set of a version of incomplete information correlated equilibrium which we dub Bayes...