Introduction
Welcome to the final lesson of our module on repeated games. In our previous lesson, we laid the groundwork by defining the set of Feasible and Individually Rational (FIR) payoffs. This set represents all the outcomes that are both achievable through coordinated play and acceptable to rational players, as they provide at least the minimum payoff each player can guarantee for themselves (their min-max value).
You saw that this FIR set often contains outcomes that are much better for everyone than the one-shot Nash Equilibrium. This begs the question: can these mutually beneficial outcomes actually be sustained as stable equilibria?
Today, we will answer that question with a resounding "yes," under the right conditions. This lesson introduces the celebrated Folk Theorem, a cornerstone of game theory. You will learn what the theorem states and, just as importantly, what its profound implications are for understanding cooperation, strategic planning, and the power of long-term relationships.
1. The Core Idea: "Anything Goes"
The name "Folk Theorem" is unusual. It doesn't credit a single person because the core idea was part of the "folklore" among game theorists in the 1950s before it was formally published. Many different researchers understood it intuitively and developed various versions of it.
Game Theory 101 (#61): The Folk Theorem
To start, let's get a brief overview of what the Folk Theorem is and why it has this name. This video from William Spaniel provides excellent context.
Watch the segment from 00:49 to 02:07. Pay attention to the main claim: the set of equilibria in infinitely repeated games is 'gigantic'.
The central message is powerful: in an infinitely repeated game, the grim reality of a one-shot equilibrium (like mutual defection in the Prisoner's Dilemma) is not the only possible outcome. If players are sufficiently patient, a vast range of outcomes—essentially any outcome in the FIR set we defined last lesson—can be sustained as an equilibrium.
2. A First Look: The Subgame Perfect Folk Theorem
Let's start with a very common and intuitive version of the theorem, sometimes called Friedman's Folk Theorem. It relies on a concept you're already familiar with: using the threat of reverting to a stage-game Nash Equilibrium to enforce cooperation.
Friedman's Folk Theorem: Let be the payoff vector from a Nash Equilibrium of the stage game. Any feasible payoff vector where every player gets a strictly better payoff than in that Nash Equilibrium (i.e., for all players ) can be supported as a Subgame Perfect Nash Equilibrium (SPNE) of the infinitely repeated game, provided the discount factor is sufficiently high.
The strategy that supports this is a direct generalization of the grim trigger:
- Phase I (Cooperation): Play the sequence of actions that generates the target average payoff .
- Phase II (Punishment): If any player deviates, immediately and forever revert to playing the stage-game Nash Equilibrium strategy profile.
The punishment is credible because, once in the punishment phase, no player has an incentive to deviate from playing the Nash Equilibrium. It is an equilibrium of that subgame. Because the threat is credible, the equilibrium is subgame perfect.
Game Theory 101 (#61): The Folk Theorem
The following clip explains this version of the theorem and the logic behind its proof. Notice how similar the utility calculation is to the one we saw for the grim trigger strategy.
Watch from 02:07 to 06:59. Focus on how the alternative strategies must give a strictly greater payoff than the stage-game NE, and how the threat to revert to the NE is credible, making the overall strategy an SPNE.
As long as players are patient enough ( is close to 1), the one-time gain from cheating is outweighed by the infinite stream of losses from triggering the punishment phase.
3. A Deeper Dive: The Nash Folk Theorem and Its Limits
Friedman's theorem is powerful, but it's limited to payoffs that are better than a stage-game NE. What about other payoffs in the FIR set? The Nash Folk Theorem makes a more general claim.
The Nash Folk Theorem: Any feasible payoff vector that is strictly individually rational (i.e., for all players , where is the min-max payoff) can be supported as a Nash Equilibrium of the infinitely repeated game, provided is sufficiently high.
This is a stronger statement because the min-max value is the absolute lowest payoff a rational player will accept, and it can be lower than the NE payoff. The proof for this theorem uses a more severe punishment: if a player deviates, all other players coordinate to play a strategy that holds the deviant down to their min-max payoff, forever.
However, this raises a critical issue that gets to the heart of your interest in strategic planning.
[PDF] 6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation
These lecture notes from MIT provide a formal statement of the Nash Folk Theorem and then brilliantly explain its main weakness: the credibility of its punishment.
Please read the following two parts on pages 24-27: Start at the 'Theorem (Nash Folk Theorem)' on page 24 and read through the proof sketch ending on page 26. This gives you the formal statement and logic. Continue with 'Problems with Nash Folk Theorem' on page 26. This section explains why the min-max punishment might be a non-credible threat, making the equilibrium not subgame perfect.
The issue is that forcing an opponent down to their min-max payoff can be extremely costly for the punishers. If carrying out the punishment hurts you more than letting the deviation slide, is your threat to punish truly credible? In many cases, it is not. This means that while the outcome is a Nash Equilibrium, it may not be a Subgame Perfect Nash Equilibrium. A rational player, anticipating that your threat is empty, might deviate anyway.
For completeness, you should know that more advanced theorems (like the Fudenberg-Maskin Folk Theorem) show that under certain technical conditions, it is possible to construct clever punishment-and-reward schemes that do make these min-max punishments subgame perfect.

4. Interpreting the Folk Theorem: Chaos or Cooperation?
So, what are the implications of the fact that almost any FIR payoff can be an equilibrium?
-
The "Shadow of the Future" Enables Cooperation: The theorem's primary message is optimistic. It provides a formal basis for how long-term interaction enables outcomes that are impossible in the short term. The threat of future punishment or the promise of future reward can discipline behavior and sustain cooperation. The key variable is patience ().
-
An Explosion of Equilibria: The Folk Theorem is sometimes called an "embarrassment of riches." By showing that so many outcomes are possible equilibria, it makes the theory less predictive. If (2,2), (2.5, 1.5), and (1.5, 2.5) are all potential stable outcomes in a repeated Prisoner's Dilemma, which one will players choose? Game theory alone cannot answer this.
-
The Importance of Coordination and Norms: This ambiguity highlights that other factors must be at play in selecting an equilibrium. Social norms, culture, history, and explicit communication can act as coordination devices, helping players converge on one of the many possible cooperative equilibria.
This video provides a great visual summary of the vast set of outcomes the Folk Theorem allows.
(AGT3E12) [Game Theory] Folk Theorem
Let's watch the conclusion of the first video, which clearly illustrates the set of payoffs that can be supported as an equilibrium.
Watch from 04:09 to 07:54. The presenter states a version of the Subgame Perfect Folk Theorem and uses the diagram of the feasible/IR set to show just how many outcomes become possible. Note the condition about the 'dimension of the set,' which is a nod to the more advanced Fudenberg-Maskin theorem.
This connects back to your goal of "meaningful planning in a chaotic world." The Folk Theorem suggests that in ongoing relationships, the future is not pre-determined by a single, bleak equilibrium. Instead, there is a wide range of possible stable futures. The challenge shifts from simply finding the "best" move to actively shaping expectations and coordinating with others to land on a favorable equilibrium within that vast set.
Conclusion
This lesson, and this module, concludes with one of the most significant results in game theory. We moved from the strict confines of one-shot games to the wide-open possibilities of repeated interaction.
Key Takeaways:
- The Folk Theorem asserts that in an infinitely repeated game with sufficiently patient players, almost any feasible and individually rational payoff can be sustained as an equilibrium outcome.
- The credibility of the supporting strategy depends on the punishment. Using reversion to a stage-game NE as punishment leads to a Subgame Perfect Nash Equilibrium (Friedman's Theorem). Using a more severe min-max punishment may result in a Nash Equilibrium that is not subgame perfect because the threat may not be credible.
- The main implication of the Folk Theorem is that long-term interaction opens a vast space for cooperation. However, it also creates a coordination problem, as players must find a way to agree on which of the many possible cooperative equilibria to aim for.
In all our analysis so far, we have assumed that players have complete information—they know all the rules, and crucially, all the payoffs for all other players. In the next module, we will relax this powerful assumption and enter the fascinating world of incomplete information, where players must make decisions without knowing the true "type" or preferences of their opponents.