Repeated games played by cryptographically sophisticated players
(1998)
Files
dp9835.pdf
Open Access - Adobe PDF
- 201.06 KB
Details
- Authors
- Abstract
- We explore the consequences of the assumptions used in modern cryptography when applied to repeated games with public communication. Technically speaking, we model agents by polynomial Turing machines and assume the existence of a trapdoor function. Under these conditions, we prove a Folk Theorem in which the minmax level of players has to be taken in correlated strategies instead of mixed strategies.
- Affiliations
Citations
Gossner, O. (1998). Repeated games played by cryptographically sophisticated players (CORE Discussion Papers 1998/35). https://hdl.handle.net/2078.5/34336