A New Necessary Condition for Implementation in Iteratively Undominated Strategies

Abstract

Implementation in iteratively undominated strategies relies on permissive conditions. However, for the sufficiency results available, authors have relied on assumptions that amount to quasilinear preferences on a numeraire. We uncover a new necessary condition that implies that such assumptions cannot be dispensed with. We term the condition “restricted deceptionproofness.” It requires that, in environments with identical preferences, the social choice function be immune to all deceptions, making it then stronger than incentive compatibility. In some environments the conditions for (exact or approximate) implementation are more restrictive than previously thought.mechanism design; exact and approximate implementation; iteratively undominated strategies; restricted deception-proofness; incentive compatibility; measurability