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

This note studies (full) implementation of social choice functions under complete information in (correlated) rationalizable strategies. The monotonicity condition shown by Maskin (1999) to be necessary for Nash implementation is also necessary under the more stringent solution concept. We show...

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

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 function for all beliefs at every type profile. In an interdependent value environment...

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

We consider the role of the common prior for robust implementation in an environment with interdependent values. Specifically, we investigate a model of public good provision which allows for negative and positive informational externalities. In the corresponding direct mechanism, the agents'...

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 consider the following belief free solution concepts for games with incomplete information: (i) incomplete information rationalizability, (ii) incomplete information correlated equilibrium and (iii) ex post equilibrium. We present epistemic foundations for these solution concepts and...

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 payoff types are strategically distinguishable if and...

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