We characterize the set of communication equilibrium payoffs of any undiscounted repeated matrix-game with imperfect monitoring and complete information. For two-player games, a characterization is provided by Mertens, Sorin, and Zamir (Repeated games, Part A (1994) CORE DP 9420), mainly using...

A sender wishes to transmit a secret to a receiver through a communication network, where some nodes are controlled by an adversary. We characterize the directed networks for which there exist ε-secret and ε-strongly secure communication protocols (∀ε0): if all nodes are obedient the...

Le maxmin pour une certaine classe de jeux répétés à observation imparfaite est obtenu comme la solution d'un problème d'optimisation défini sur l'ensemble des distributions de probabilités sous contraintes d'entropie. Cette article offre une méthode pour résoudre un tel problème dans...

We characterize the minmax 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...

An observer of a process View the MathML source believes the process is governed by Q whereas the true law is P. We bound the expected average distance between P(xt|x1,…,xt−1) and Q(xt|x1,…,xt−1) for t=1,…,n by a function of the relative entropy between the marginals of P and Q on the...

Le maxmin pour une certaine classe de jeux répétés à observation imparfaite est obtenu comme la solution d'un problème d'optimisation défini sur l'ensemble des distributions de probabilités sous contraintes d'entropie. Cette article offre une méthode pour résoudre un tel problème dans...

This paper studies finitely repeated games with semi-standard monitoring played in pure strategies. In these games, each player's action set is endowed with a partition, and the equivalence classes of the actions played are publicly observed. We characterize the limit set of equilibrium payoffs...

This paper studies finitely repeated games with semi-standard monitoring played in pure strategies. In these games, each player's action set is endowed with a partition, and the equivalence classes of the actions played are publicly observed. We characterize the limit set of equilibrium payoffs...

This paper considers dynamic implementation problems with evolving private information (according to Markov processes). A social choice function is approximately implementable if there exists a dynamic mechanism such that the social choice function is implemented by an arbitrary large number of...

This paper studies a mechanism design model where the players and the designer are nodes in a communication network. We characterize the communication networks (directed graphs) for which, in any environment (utilities and beliefs), every incentive compatible social choice function is partially...