Robust Implementation in General Mechanisms

Abstract

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 stronger than both Maskin monotonicity (necessary and almost sufficient for complete information implementation) and ex post monotonicity (necessary and almost sufficient for ex post implementation). It is equivalent to Bayesian monotonicity on all type spaces.

Keywords: Mechanism design, Implementation, Robustness, Common knowledge, Interim equilibrium, Dominant strategies

JEL Classification: C79, D82