An Anti-Folk Theorem for Large Repeated Games with Imperfect Monitoring.

CoRR(2014)

引用 28|浏览45
暂无评分
摘要
We study infinitely repeated games in settings of imperfect monitoring. We first prove a family of theorems that show that when the signals observed by the players satisfy a condition known as $(\epsilon, \gamma)$-differential privacy, that the folk theorem has little bite: for values of $\epsilon$ and $\gamma$ sufficiently small, for a fixed discount factor, any equilibrium of the repeated game involve players playing approximate equilibria of the stage game in every period. Next, we argue that in large games ($n$ player games in which unilateral deviations by single players have only a small impact on the utility of other players), many monitoring settings naturally lead to signals that satisfy $(\epsilon,\gamma)$-differential privacy, for $\epsilon$ and $\gamma$ tending to zero as the number of players $n$ grows large. We conclude that in such settings, the set of equilibria of the repeated game collapse to the set of equilibria of the stage game.
更多
查看译文
关键词
large repeated games,monitoring,anti-folk
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要