Repeated proximity games

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 theorem holds for any payoff function if and only if the graph is 2-connected, and then extend this result to the context of finitely repeated games.