The iterated prisoner's dilemma is a repeated version of the prisoner's dilemma where each round lets players react to past choices. In Game Theory, it shows how cooperation can emerge when future rounds matter.
The iterated prisoner's dilemma is the repeated version of the classic prisoner's dilemma in Game Theory, where the same two players face the same choice over and over instead of just once. Each round, they decide whether to cooperate or defect, and the payoff in that round depends on both players' choices.
What makes this version different is that players can respond to earlier moves. If someone defects in round 1, the other player can punish them in round 2. If someone cooperates, the other player can reward that choice by cooperating back. That memory of past behavior is what turns a simple one-shot game into a much richer strategic problem.
In a single prisoner's dilemma, defection is usually the dominant strategy because it gives the safer payoff no matter what the other person does. But in repeated play, the future changes the calculation. If you expect to meet the same opponent again, a short-term betrayal can cost you later cooperation, while a cooperative move can build trust and keep the other player willing to cooperate too.
This is why strategies in the iterated prisoner's dilemma are often described in terms of style, not just payoff. Tit-for-tat is the classic example: start by cooperating, then copy the other player's last move. It is simple, transparent, and retaliatory without being overly harsh, so it can encourage mutual cooperation while still responding to defection.
The length of the interaction matters a lot. If the game has a known final round, cooperation can break down near the end because there is no future punishment left. If the game is infinitely repeated, or just repeated enough times that the future feels real, cooperation is easier to sustain. That is why the iterated prisoner's dilemma is a favorite model for trust, reputation, and long-term strategy.
The iterated prisoner's dilemma shows why rational self-interest does not always produce selfish behavior. In Game Theory, it gives you a clean model for explaining how cooperation can survive even when defection looks best in one isolated round.
It also gives you a way to compare different strategic patterns. A player can be forgiving, punitive, predictable, or random, and each approach changes the long-run outcome. That makes the term useful when you are analyzing why one strategy beats another across many rounds, not just in a single payoff table.
This concept shows up in repeated-game problems, strategy comparisons, and examples about business deals, arms races, or social trust. If two firms keep interacting, or two countries expect future negotiations, a one-time betrayal may be too expensive. The iterated prisoner's dilemma is the model you use to explain that tension between short-term gain and long-term benefit.
It also connects to biology and cooperation in groups. When repeated interactions matter, helping behavior can persist because individuals who cooperate now may be rewarded later. So the term is not just about one puzzle with two prisoners, it is a framework for thinking about how cooperation gets built and maintained in strategic environments.
Keep studying Game Theory Unit 1
Visual cheatsheet
view galleryNash Equilibrium
The prisoner's dilemma has a one-shot Nash equilibrium where both players defect, but the iterated version complicates that result. When future rounds matter, the best move today can depend on whether cooperation keeps the other player cooperating tomorrow. That is why repeated games often look different from a single equilibrium snapshot.
Defection
Defection is the tempting move in each round because it can give a better immediate payoff. In the iterated prisoner's dilemma, though, repeated defection can trigger punishment and destroy future cooperation. The term helps you see defection as a short-run tactic with long-run consequences.
Cooperation
Cooperation is the main outcome the iterated prisoner's dilemma is used to explain. In a repeated setting, cooperation can become stable when players expect future interaction and can condition their choices on past behavior. The game shows when cooperation is fragile and when it can actually be self-enforcing.
Finitely and Infinitely Repeated Games
The iterated prisoner's dilemma is one of the clearest examples of a repeated game. Whether the number of rounds is fixed or uncertain changes the strategy completely, especially near the end of play. That difference explains why some repeated interactions support cooperation while others unravel.
A quiz or problem-set question may give you a payoff matrix and ask what happens when the prisoner's dilemma is repeated. Your job is to explain why a strategy like tit-for-tat can support cooperation, or why a known final round can cause defection near the end. You may also be asked to compare a one-shot game with an iterated one and describe how future interaction changes incentives.
In short-answer work, use the term when a scenario depends on memory, reputation, or punishment across rounds. If the prompt mentions firms, countries, roommates, or bargaining partners meeting again, the iterated prisoner's dilemma is often the right model. The strongest answers connect the repeated structure to the payoff logic instead of just naming the game.
The prisoner's dilemma is the single-round version, while the iterated prisoner's dilemma repeats the same choice across multiple rounds. That repetition matters because players can react to earlier moves, which opens the door to cooperation, retaliation, and trust-building.
The iterated prisoner's dilemma is a repeated strategic game, not just one isolated decision.
Past moves matter, so players can punish defection or reward cooperation over time.
A strategy like tit-for-tat starts with cooperation and then copies the other player's last move.
Repeated interaction can make cooperation rational, even when defection is the best move in a single round.
The concept is useful for studying trust, reputation, bargaining, and long-term strategic relationships.
It is the repeated version of the prisoner's dilemma, where the same players make the same cooperate-or-defect choice across multiple rounds. The repetition changes strategy because players can respond to earlier behavior. That makes cooperation possible even when defection would win in a one-time game.
Tit-for-tat works because it is simple, fair, and easy to predict. It starts with cooperation, then matches the other player's last move, so cooperation is rewarded and defection is answered right away. That balance often pushes both players toward mutual cooperation.
The normal version is played once, so each player focuses on the immediate payoff. The iterated version repeats the interaction, which means future rounds can punish betrayal or reward trust. That extra time horizon changes the whole strategy.
Look for a repeated payoff matrix, a fixed or uncertain number of rounds, or language about future interactions. If the prompt mentions reputation, retaliation, forgiveness, or long-term cooperation, it is usually pointing you toward the iterated version. The key move is to explain how the future changes the current choice.