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

We characterize the max min of repeated zero-sum games in which player one plays in pure strategies sonditional on the private observation of a fixed sequence random variables. Meanwhile we introduce a definition of a strategic distance between probability measures, and relate it to the standard...

In order to get rid of the condition X=Y, we introduce an extension of the Dynkin game by allowing for an extended set of strategies, namely the set of mixed strategies. The main result of the paper is that the extended Dynkin game has a value when the processes X and Y are only restricted to be...

We construct a non-zero sum game on the square, with separately continuous payoff functions, and which has no correlated equilibrium. This answers a recent question of Nowak.

We consider the "and" communication device that receives inputs 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 using this device, even when infinitely many stages of communication are...