The Folk Theorem with Imperfect Public Information
证明，在不完全公共信息的重复博弈中，若每对参与人存在一个行动组合使得公开结果能区分单方偏离，且可行支付集维数等于参与人数，则民间定理成立。结果适用于代理模型、寡头垄断和重复机制设计。
The Folk Theorem obtains in repeated games with imperfect public information if for each pair of agents there is at least one action profile where the information revealed by the publicly observed outcome permits deviations by one of the agents to be statistically distinguished from deviations by the other, and the dimension of the set of feasible payoffs equals the number of players.Under somewhat stronger conditions, we obtain a Folk Theorem for strict equilibria.Without pairwise full rank, a "Nash-threats" Folk Theorem obtains if the observed outcomes statisticallygive independent information about each player's actions.We give applications of our results to repeated agency models, the Green-Porter oligopoly model and repeated mechanism design.