Games on networks have been studied extensively, however, I was not able to find a folk theorem for games on networks. Is there one or can it be derived from an already existing folk theorem? With games on networks I mean games in which the payoff of the stage game only depends on the actions of the direct neighbors in a network. Simple examples for that would be the the majority game (in which the payoff depends on the number of neighbors that play the same action as you are) or a prisoner\'s dilemma played with each neighbor. Solution Yes, there are folk theorems for games on networks, of cause depending on information structure and possible communication. Here are some of the most relevant papers:.