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.

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 payoffs in terms of simple strategies in which an explanation phase is followed by a...

It is well known that, whereas in one-agent contexts the value of information is always positive, in strategic situations, this is not always the case. We will consider the class of games for which, under a specific information structure, there exists a unique Pareto payoff profile, and we show...

One of the main goals of bounded rationality models is to understand the limitations of agent's abilities in building representations of strategic situations as maximization problems and in solving these problems. Modern cryptography relies on the assumption that agents's computations should be...