@inproceedings{142441737b2f4b53bb4fdc8d47b01fba,
title = "The truth behind the myth of the folk theorem",
abstract = "We study the problem of computing an ε-Nash equilibrium in repeated games. Earlier work by Borgs et al. [2010] suggests that this problem is intractable. We show that if we make a slight change to their model - modeling the players as polynomial-time Turing machines that maintain state (rather than stateless polynomial-time Turing machines) - and make some standard cryptographic hardness assumptions (the existence of public-key encryption), the problem can actually be solved in polynomial time.",
keywords = "Computing Nash equilibrium, Folk theorem, Repeated games",
author = "Halpern, \{Joseph Y.\} and Rafael Pass and Lior Seeman",
year = "2014",
doi = "10.1145/2554797.2554847",
language = "الإنجليزيّة",
isbn = "9781450322430",
series = "ITCS 2014 - Proceedings of the 2014 Conference on Innovations in Theoretical Computer Science",
publisher = "Association for Computing Machinery",
pages = "543--552",
booktitle = "ITCS 2014 - Proceedings of the 2014 Conference on Innovations in Theoretical Computer Science",
address = "الولايات المتّحدة",
note = "2014 5th Conference on Innovations in Theoretical Computer Science, ITCS 2014 ; Conference date: 12-01-2014 Through 14-01-2014",
}