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

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 characterized and shown to be equivalent to the set of a version of incomplete information correlated...

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

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

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

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 essay is the introduction for a collection of papers by the two of us on "Robust Mechanism Design" to be published by World Scientific Publishing. The appendix of this essay lists the chapters of the book.The objective of this introductory essay is to provide the reader with an overview of...

We study a strict version of the notion of equilibrium robustness by Kajii and Morris (1997) that allows for a larger class of incomplete information perturbations of a given complete information game, where with high probability, players believe that their payoffs are close to (but may be...

A social choice function is robustly implemented if every equilibrium on every type space achieves outcomes consistent with a social choice function. We identify a robust monotonicity condition that is necessary and (with mild extra assumptions) sufficient for robust implementation. Robust...

A social choice function is robustly implementable if there is a mechanism under which the process of iteratively eliminating strictly dominated messages leads to outcomes that agree with the social choice at every type profile. In an interdependent value environment with single crossing...