Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article
Public Access

An Antifolk Theorem for Large Repeated Games

Published: 12 October 2016 Publication History

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.

References

[1]
Dilip Abreu and Ariel Rubinstein. 1988. The structure of Nash equilibrium in repeated games with finite automata. Econometrica 56, 6, 1259--1281.
[2]
Nabil I. Al-Najjar and Rann Smorodinsky. 2001. Large nonanonymous repeated games. Games and Economic Behavior 37, 1, 26--39.
[3]
Yu Awaya and Vijay Krishna. 2016. On communication and collusion. American Economic Review 106, 2, 285--315.
[4]
Christian Borgs, Jennifer Chayes, Nicole Immorlica, Adam Tauman Kalai, Vahab Mirrokni, and Christos Papadimitriou. 2010. The myth of the folk theorem. Games and Economic Behavior 70, 1, 34--43.
[5]
Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, and Salil Vadhan. 2013. Truthful mechanisms for agents that value privacy. In Proceedings of the 14th ACM Conference on Electronic Commerce. ACM, New York, NY, 215--232.
[6]
Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, and Moni Naor. 2006a. Our data, ourselves: Privacy via distributed noise generation. In Advances in Cryptology—EUROCRYPT 2006. Lecture Notes in Computer Science, Vol. 4004. Springer, 486--503. 10.1007/11761679_29
[7]
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. 2006b. Calibrating noise to sensitivity in private data analysis. In Proceedings of the 3rd Conference on Theory of Cryptology (TCC’06). 265--284.
[8]
Cynthia Dwork, Guy N. Rothblum, and Salil Vadhan. 2010. Boosting and differential privacy. In Proceedings of the 2010 51st Annual IEEE Symposium onFoundations of Computer Science (FOCS’10). IEEE, Los Alamitos, CA, 51--60.
[9]
D. P. Foster and R. V. Vohra. 1997. Calibrated learning and correlated equilibrium. Games and Economic Behavior 21, 1--2, 40--55.
[10]
Drew Fudenberg, David Levine, and Eric Maskin. 1994. The folk theorem with imperfect public information. Econometrica 62, 5, 997--1039.
[11]
Arpita Ghosh and Katrina Ligett. 2013. Privacy and coordination: Computing on databases with endogenous participation. In Proceedings of the 14th ACM Conference on Electronic Commerce. 543--560.
[12]
Arpita Ghosh and Aaron Roth. 2015. Selling privacy at auction. Games and Economic Behavior 91, 334--346.
[13]
Ronen Gradwohl and Omer Reingold. 2008. Fault tolerance in large games. In Proceedings of the 9th ACM Conference on Electronic Commerce (EC’08). ACM, New York, NY, 274--283. 10.1145/1386790.1386833
[14]
Edward J. Green. 1980. Noncooperative price taking in large dynamic markets. Journal of Economic Theory 22, 2, 155--182.
[15]
Edward J. Green and Robert H. Porter. 1984. Noncooperative collusion under imperfect price information. Econometrica 52, 1, 87--100.
[16]
Joseph Y. Halpern, Rafael Pass, and Lior Seeman. 2014. The truth behind the myth of the folk theorem. In Proceedings of the 5th Conference on Innovations in Theoretical Computer Science (ITCS’14). ACM, New York, NY, 543--554.
[17]
Moritz Hardt and Aaron Roth. 2012. Beating randomized response on incoherent matrices. In Proceedings of the 44th Symposium on Theory of Computing. ACM, New York, NY, 1255--1268.
[18]
S. Hart and A. Mas-Colell. 2000. A simple adaptive procedure leading to correlated equilibrium. Econometrica 68, 5, 1127--1150.
[19]
Michael Kearns, Mallesh Pai, Aaron Roth, and Jonathan Ullman. 2014. Mechanism design in large games: Incentives and Privacy. In Proceedings of the 5th Conference on Innovations in Theoretical Computer Science (ITCS’14). ACM, New York, NY, 403--410.
[20]
D. K. Levine and W. Pesendorfer. 1995. When are agents negligible? American Economic Review 85, 5, 1160--1170.
[21]
George J. Mailath, Ichiro Obara, and Tadashi Sekiguchi. 2002. The maximum efficient equilibrium payoff in the repeated prisoners’ dilemma. Games and Economic Behavior 40, 1, 99--122.
[22]
George J. Mailath and Larry Samuelson. 2006. Repeated Games and Reputations: Long-Run relationships. Oxford University Press.
[23]
Richard McLean and Andrew Postlewaite. 2002. Informational size and incentive compatibility. Econometrica 70, 6, 2421--2453.
[24]
Frank McSherry and Kunal Talwar. 2007. Mechanism design via differential privacy. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS’07). IEEE, Los Alamitos, CA, 94--103.
[25]
Nimrod Megiddo and Avi Wigderson. 1986. On play by means of computing machines: Preliminary version. In Proceedings of the 1986 Conference on Theoretical Aspects of Reasoning about Knowledge. 259--274.
[26]
Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay Vazirani. 2007. Algorithmic Game Theory. Cambridge University Press.
[27]
Kobbi Nissim, Claudio Orlandi, and Rann Smorodinsky. 2012a. Privacy-aware mechanism design. In Proceedings of the 13th ACM Conference on Electronic Commerce. ACM, New York, NY, 774--789.
[28]
Kobbi Nissim, Rann Smorodinsky, and Moshe Tennenholtz. 2012b. Approximately optimal mechanism design via differential privacy. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS’12). ACM, New York, NY, 203--213.
[29]
Kobbi Nissim, Salil Vadhan, and David Xiao. 2014. Redrawing the boundaries on purchasing data from privacy-sensitive individuals. In Proceedings of the 5th Conference on Innovations in Theoretical Computer Science (ITCS’14). ACM, New York, NY, 411--422.
[30]
Mallesh M. Pai and Aaron Roth. 2013. Privacy and mechanism design. ACM SIGecom Exchanges 12, 1, 8--29.
[31]
Christos H. Papadimitriou and Mihalis Yannakakis. 1994. On complexity as bounded rationality. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing. ACM, New York, NY, 726--733.
[32]
Ryan M. Rogers and Aaron Roth. 2014. Asymptotically truthful equilibrium selection in large congestion games. In Proceedings of the 15th ACM Conference on Economics and Computation (EC’14). ACM, New York, NY, 771--782.
[33]
Hamid Sabourian. 1990. Anonymous repeated games with a large number of players and random outcomes. Journal of Economic Theory 51, 1, 92--110.
[34]
Takuo Sugaya. 2011. Folk Theorem in Repeated Games with Private Monitoring. Technical Report 011-2011. Stanford University, Stanford, CA.
[35]
David Xiao. 2013. Is privacy compatible with truthfulness? In Proceedings of the 4th Conference on Innovations in Theoretical Computer Science. ACM, New York, NY, 67--86.

Cited By

View all
  • (2023)ENetRM: ElasticNet Regression Model based malicious cyber-attacks prediction in real-time serverMeasurement: Sensors10.1016/j.measen.2022.10065425(100654)Online publication date: Feb-2023
  • (2022)More Than Privacy: Applying Differential Privacy in Key Areas of Artificial IntelligenceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.301424634:6(2824-2843)Online publication date: 1-Jun-2022
  • (2022)Cheap Talk, Monitoring and CollusionReview of Industrial Organization10.1007/s11151-021-09851-wOnline publication date: 14-Jan-2022
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Economics and Computation
ACM Transactions on Economics and Computation  Volume 5, Issue 2
May 2017
125 pages
ISSN:2167-8375
EISSN:2167-8383
DOI:10.1145/3007668
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 October 2016
Accepted: 01 July 2016
Revised: 01 July 2015
Received: 01 November 2014
Published in TEAC Volume 5, Issue 2

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Repeated games
  2. differential privacy
  3. folk theorem

Qualifiers

  • Research-article
  • Research
  • Refereed

Funding Sources

  • NSF
  • NSF CAREER grant
  • Google Research grant

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)81
  • Downloads (Last 6 weeks)12
Reflects downloads up to 14 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2023)ENetRM: ElasticNet Regression Model based malicious cyber-attacks prediction in real-time serverMeasurement: Sensors10.1016/j.measen.2022.10065425(100654)Online publication date: Feb-2023
  • (2022)More Than Privacy: Applying Differential Privacy in Key Areas of Artificial IntelligenceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.301424634:6(2824-2843)Online publication date: 1-Jun-2022
  • (2022)Cheap Talk, Monitoring and CollusionReview of Industrial Organization10.1007/s11151-021-09851-wOnline publication date: 14-Jan-2022
  • (2021)More than PrivacyACM Computing Surveys10.1145/346077154:7(1-37)Online publication date: 18-Jul-2021
  • (2020)Anti-Honeypot Enabled Optimal Attack Strategy for Industrial Cyber-Physical SystemsIEEE Open Journal of the Computer Society10.1109/OJCS.2020.30308251(250-261)Online publication date: 2020
  • (2019)Communication and cooperation in repeated gamesTheoretical Economics10.3982/TE304914:2(513-553)Online publication date: 2019
  • (2018)Bounding payoffs in repeated games with private monitoring: n -player gamesJournal of Economic Theory10.1016/j.jet.2018.01.007175(58-87)Online publication date: May-2018

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media