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

The set of payoffs associated to pure uniform equilibria of a repeated game with public observation is characterized in terms of the one shot-game. The key of the result is first, a study of the effect of undetectable deviations and the second, the definition of new types of punishments using...

We propose a model of discrete time dynamic congestion games with atomic players and a single source-destination pair. The latencies of edges are composed by free-flow transit times and possible queuing time due to capacity constraints. We give a precise description of the dynamics induced by...

We characterize belief-free equilibria in infinitely repeated games with incomplete information with N \ge 2 players and arbitrary information structures. This characterization involves a new type of individual rational constraint linking the lowest equilibrium payoffs across players. The...

This paper studies extensive form games with perfect information and simultaneous moves, henceforth called games with public information. On this class, we prove that all communication equilibrium payoffs can be obtained without mediator by cheap-talk procedures. The result encompasses repeated...

We consider repeated games with complete information and imperfect monitoring, where each player is assigned a fixed subset of players and only observes the moves chosen by the players in this subset. This structure is naturally represented by a directed graph. We prove that a generalized folk...