An Antifolk Theorem for Large Repeated Games

Author:

Pai Mallesh M.1,Roth Aaron2,Ullman Jonathan3

Affiliation:

1. University of Pennsylvania

2. University of Pennsylvania, Philadelphia PA

3. Columbia University, Boston, MA

Abstract

In this article, we study infinitely repeated games in settings of imperfect monitoring. We first prove a family of theorems showing that when the signals observed by the players satisfy a condition known as (ϵ, γ)-differential privacy, the folk theorem has little bite: for values of ϵ and γ sufficiently small, for a fixed discount factor, any equilibrium of the repeated game involves 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 (ϵ, γ)-differential privacy for ϵ and γ 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 collapses to the set of equilibria of the stage game. Our results nest and generalize previous results of Green [1980] and Sabourian [1990], suggesting that differential privacy is a natural measure of the “largeness” of a game. Further, techniques from the literature on differential privacy allow us to prove quantitative bounds, where the existing literature focuses on limiting results.

Funder

NSF

NSF CAREER grant

Google Research grant

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Marketing,Economics and Econometrics,Statistics and Probability,Computer Science (miscellaneous)

Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. ENetRM: ElasticNet Regression Model based malicious cyber-attacks prediction in real-time server;Measurement: Sensors;2023-02

2. Monitoring versus Discounting in Repeated Games;Econometrica;2023

3. More than Privacy;ACM Computing Surveys;2022-09-30

4. Cheap Talk, Monitoring and Collusion;Review of Industrial Organization;2022-01-14

5. More Than Privacy: Applying Differential Privacy in Key Areas of Artificial Intelligence;IEEE Transactions on Knowledge and Data Engineering;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3