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

The motivation of this paper comes from repeated games with incomplete information and imperfect monitoring. It concerns the existence, for any payoff function, of a particular equilibrium (called completely revealing) allowing each player to learn the state of nature. We consider thus an...

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