Robust Mechanism Design
探讨如何在不完全共同知识的大类型空间上实现给定目标，将通用类型空间上的均衡实施条件转化为原始类型空间上的强解概念。
Preliminary and incomplete The implementation literature is often criticized because the mechanisms do not seem to be robust to assumed features of the underlying environment. This paper explores one way of formalizing robustness: fixing the set of payoff relevant types of each player, we ask whether it is possible to implement a given object on large type spaces (reflecting a lack of common knowledge the environment). We show how equilibrium implementation conditions on the universal type space translates into strong solution concepts on the original types space of payoff relevant types.