Theoretical Economics 4 (2009), 45–88
Robust virtual implementation
Dirk Bergemann, Stephen Morris
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 only if they satisfy a separability condition. The separability condition for each agent essentially requires that there is not too much interdependence in preferences across agents. A social choice function, mapping payoff type profiles to outcomes, can be robustly virtually implemented if there exists a mechanism such that every equilibrium on every type space achieves an outcome that is arbitrarily close to the outcome generated by the social choice function. This definition is equivalent to requiring virtual implementation in iterated deletion of strategies that are strictly dominated for all beliefs. The social choice function is robustly measurable if strategically indistinguishable payoff types receive the same allocation. We show that ex post incentive compatibility and robust measurability are necessary and sufficient for robust virtual implementation.
Keywords: Mechanism design, virtual implementation, robust implementation, rationalizability, ex-post incentive compatibility
JEL classification: C79, D82
Full Text: PRINT VIEW