We introduce a procedure that uses basic typological charasteristics of equilibrium correspondences of standard equilibrium concepts, to define broad equivalence classes of finite generic games in normal form. The proposed procedure is viewed as a potentially useful way of both organizing the...

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...