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

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.

[1]  Silvio Micali,et al.  On Play by Means of Computing Machines (Preliminary Version).@@@A Theory of Higher Order Probabilities.@@@Knowledge and Efficient Computation.@@@Realizability Semantics for Error-Tolerant Logics (Preliminary Version). , 1988 .

[2]  D. Levine,et al.  When Are Agents Negligible , 1995 .

[3]  S. Hart,et al.  A simple adaptive procedure leading to correlated equilibrium , 2000 .

[4]  Omer Reingold,et al.  Fault tolerance in large games , 2008, EC '08.

[5]  Rann Smorodinsky,et al.  Large Nonanonymous Repeated Games , 2001, Games Econ. Behav..

[6]  E. Green Noncooperative price taking in large dynamic markets , 1980 .

[7]  Oriol Carbonell-Nicolau Games and Economic Behavior , 2011 .

[8]  D. Fudenberg,et al.  Digitized by the Internet Archive in 2011 with Funding from Working Paper Department of Economics the Folk Theorem with Imperfect Public Information , 2022 .

[9]  Adam Tauman Kalai,et al.  The myth of the folk theorem , 2008, Games Econ. Behav..

[10]  Kobbi Nissim,et al.  Privacy-aware mechanism design , 2011, EC '12.

[11]  David Xiao,et al.  Is privacy compatible with truthfulness? , 2013, ITCS '13.

[12]  G. Mailath,et al.  The Maximum Efficient Equilibrium Payoff in the Repeated Prisoners' Dilemma , 2000 .

[13]  Joseph Y. Halpern,et al.  The truth behind the myth of the folk theorem , 2013, ITCS.

[14]  Kobbi Nissim,et al.  Redrawing the boundaries on purchasing data from privacy-sensitive individuals , 2014, ITCS.

[15]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[16]  Kunal Talwar,et al.  Mechanism Design via Differential Privacy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[17]  Aaron Roth,et al.  Privacy and mechanism design , 2013, SECO.

[18]  Tadashi Sekiguchi,et al.  The Maximum Efficient Equilibrium Payoff in the Repeated Prisoners' Dilemma , 2000, Games Econ. Behav..

[19]  Aaron Roth,et al.  Mechanism design in large games: incentives and privacy , 2012, ITCS.

[20]  Avi Wigderson,et al.  On Play by Means of Computing Machines , 1986, TARK.

[21]  Stephen Chong,et al.  Truthful mechanisms for agents that value privacy , 2011, EC.

[22]  Aaron Roth,et al.  Selling privacy at auction , 2010, EC '11.

[23]  H. Sabourian Anonymous repeated games with a large number of players and random outcomes , 1990 .

[24]  Guy N. Rothblum,et al.  Boosting and Differential Privacy , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[25]  Richard P. McLean,et al.  Informational Size and Incentive Compatibility , 2001 .

[26]  Aaron Roth,et al.  Asymptotically truthful equilibrium selection in large congestion games , 2013, EC.

[27]  Moshe Tennenholtz,et al.  Approximately optimal mechanism design via differential privacy , 2010, ITCS '12.

[28]  R. Vohra,et al.  Calibrated Learning and Correlated Equilibrium , 1996 .

[29]  A. Rubinstein,et al.  The Structure of Nash Equilibrium in Repeated Games with Finite Automata (Now published in Econometrica, 56 (1988), pp.1259-1282.) , 1986 .

[30]  Aaron Roth,et al.  Beating randomized response on incoherent matrices , 2011, STOC '12.

[31]  Cynthia Dwork,et al.  Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.

[32]  G. Mailath,et al.  Repeated Games and Reputations: Long-Run Relationships , 2006 .

[33]  Takuo Sugaya Folk Theorem in Repeated Games with Private Monitoring , 2011 .

[34]  R. Porter,et al.  NONCOOPERATIVE COLLUSION UNDER IMPERFECT PRICE INFORMATION , 1984 .

[35]  Moni Naor,et al.  Our Data, Ourselves: Privacy Via Distributed Noise Generation , 2006, EUROCRYPT.

[36]  Arpita Ghosh,et al.  Privacy and coordination: computing on databases with endogenous participation , 2013, EC '13.