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

I consider repeated games with private monitoring played on a network. Each player has a set of neighbors with whom he interacts: a player's payoff depends on his own and his neighbors' actions only. Monitoring is private and imperfect: each player observes his stage payoff but not the actions...

I consider repeated games on a network where players interact and communicate with their neighbors. At each stage, players choose actions and exchange private messages with their neighbors. The payoff of a player depends only on his own action and on the actions of his neighbors. At the end of...

I consider repeated games with local monitoring: each player observes his neighbors’ moves only. Hence, monitoring is private and imperfect. Communication is private: each player can send different (costless) messages to different players. The solution concept is perfect Bayesian equilibrium....