This paper studies situations in which agents do not initially know the effect of their decisions, but learn from experience the payoffs induced by their choices and their opponent's. We characterize equilibrium paysoffs in termsof simple strategies in which an explanation phase is followed by a...

Correlated equilibria and communication equilibria are useful notions to understand the strategic effects of information and communication. Between these two models, a protocol generates information through communication. We define a secure protocol as a protocol from which no individual may...

We consider the "and" communication mechanism that inputs messages from two players and outputs the public signal "yes" if both messages are "yes", and outputs "no" otherwise. We prove that no correlation can securely be implemented through finite or infinite repetition of this mechanism.

Several authors have observed that in interactive decision frameworks, welfare is not monotonic with information in the sense that more information can make agents worse off. This contrasts with Blackwell’s comparison of statistical experiments in which more information can only make the...

Many results on repeated games played by finite automata rely on the complexity of the exact implementation of a coordinated play of length n. For a large proportion of sequences, this complexity appears to be no less than n. We study the complexity of a coordinated play when allowing for a few...

We characterize the min max values of a class of repeated games with imperfect monitoring. Our result relies on the optimal trade-off for the team formed by punishing players between optimization of stage-payoffs and generation of signals for future correlation. Amounts of correlation are...

We explore the consequences of the assumptions used in modern cryptographywhen applied to repeated games with public communication. Technically speaking, we model agents by polynomial Turing machinesand assume the existence of a trapdoor function. Under these conditions, we prove a Folk Theorem...