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

We consider the implementation of social choice functions under complete information in rationalizable strategies. A strict version of the monotonicity condition introduced by Maskin is necessary under the solution concept of rationalizability. Assuming the social choice function is responsive,...

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

We analyze the problem of fully implementing a social choice set in ex post equilibrium. We identify an ex post monotonicity condition that is necessary and--in economic environments--sufficient for full implementation in ex post equilibrium. We also identify an ex post monotonicity no veto...

We consider an single object auction environment with interdependent valuations and a generalized Vickrey-Clark-Groves allocation mechanism that allocates the object almost efficiently in a strict ex post equilibrium. If there is a significant amount of interdependence, there are multiple...

We analyze the problem of fully implementing a social choice set in ex post equilibrium. Weidentify an ex post monotonicity condition that is necessary and -- in economic environments -- sufficient for full implementation in ex post equilibrium. We also identify an ex post monotonicityno veto...

We discuss four solution concepts for games with incomplete information. We show how each solution concept can be viewed as encoding informational robustness. For a given type space, we consider expansions of the type space that provide players with additional signals. We distinguish between...

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