Repeated games played by cryptographically sophisticated players
Olivier Gossner · RePEc: Research Papers in Economics · 1998
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.