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

We introduce a game in preference form, which consists of a game form and a preference structure, and define preference rationalizability that allows for each player's ex-post preferences over outcomes to depend on opponents' actions. We show that preference rationalizability is invariant to...

In conventional epistemic analysis of solution concepts in complete information games, complete information is implicitly interpreted to mean common certainty of (i) a mapping from action profiles to outcomes; (ii) players' (unconditional) preferences over outcomes; and (iii) players'...