Robust Implementation: The Role of Large Type Spaces

Abstract

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 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. It requires that there not be too much interdependence of types.

We characterize robust monotonicity for some interesting economic environments. We identify conditions where, if robust implementation is possible, it is possible in a direct mechanism. We identify conditions where, if robust implementation is not possible, virtual robust implementation is not possible either.

Keywords: Mechanism Design, Implementation, Robustness, Common Knowledge, Interim Equilibrium, Interative Deletion, Dominant Strategies

JEL Classification: C79, D82