Efficient Repeated Implementation
研究了无限期重复实施社会选择函数的问题，发现完全信息下该函数可重复实施当且仅当它是高效的，为机制设计提供了理论依据。
This paper examines repeated implementation of a social choice function (SCF) with infinitely lived agents whose preferences are determined randomly in each period. An SCF is repeatedly implementable in Nash equilibrium if there exists a sequence of (possibly history-dependent) mechanisms such that its Nash equilibrium set is nonempty and every equilibrium outcome path results in the desired social choice at every possible history of past play and realizations of uncertainty. We show, with minor qualifications, that in the complete information environment an SCF is repeatedly implementable in Nash equilibrium if and only if it is efficient. We also discuss several extensions of our analysis.