A folk theorem for repeated games played on a network

► We study repeated games on a social network with partial monitoring. ► Each player has a set of neighbors with whom he interacts and communicates. ► We find necessary and sufficient conditions to have a protocol that identifies a deviator in finite time. ► We derive necessary and sufficient conditions to have a folk theorem.