Consider this: you and a fellow thief escape the Louvre with the Mona Lisa, running like shadows into the night. You are fast, but not fast enough, as the blue and red lights of law enforcement flash ahead of you. Before long, you find yourself seated in an interrogation room. The police suspect the both of you, but lack the evidence to convict either of you for the actual heist. The following dialogue ensues:

Detective: We’ve got a deal for you. If you confess and testify against your partner, you get to walk free. They get five years.

You: And if I don’t?

Detective: If neither of you confess, you both get two years. If your partner confesses and you don’t, you’re looking at five years in prison.

You: And if we both confess?

Detective: Three years each.

Let’s take a pause and assess your predicament. You know that your partner has been presented with the same offer. If they remain silent, your confession guarantees your freedom. If they confess, doing the same spares you from a five year sentence. In both situations, confessing is the optimal choice. However, the sentence you receive in the situation where you both confess is actually longer than the one you’d receive if both of you stayed silent. Therein lies the prisoner’s dilemma: the decision that is most advantageous for each individual ultimately produces a collectively worse outcome for both.

In game theory, confessing is referred to as a dominant strategy, as it yields the most favorable outcome for a player, irrespective of the other player’s decision. When both players confess, they arrive at a state known as the Nash equilibrium, a situation in which neither player has an incentive to willingly change their decision even if they know what the other player’s decision is. 

The concept of the prisoner’s dilemma originated in 1950, when mathematicians Merrill Flood and Melvin Dresher explored strategic interactions and nuclear deterrence during the Cold War. To test their theory, they had two other economists play the game a hundred times. Later, mathematician Albert Tucker formalized the concept into the prisoner-based framing that would give the dilemma its name.

This situation extends to modern-day events as well. Consider climate change, for one. Every country benefits from reduced carbon emissions, but transitioning toward renewable energy can be economically costly. As a result, governments hesitate to implement stricter environmental policies, hoping other nations will shoulder the responsibility instead. When every country adopts this approach, collective progress stagnates, leaving all parties with a worse outcome.

A similar dynamic unfolds in international relations. In periods of geopolitical tension, nations may engage in an arms race, continually expanding their military capabilities out of fear that remaining unarmed will leave them vulnerable. Although neither side necessarily benefits from escalating military expenditure, neither wants to risk being the only one to disarm. What emerges is a cycle of mutual distrust in which both parties sacrifice collective security for individual protection.

Another similar effect appears in business decisions. Social media platforms compete for users’ attention by prioritizing increasingly sensationalized content, despite the broader consequences of misinformation and public discourse. While no individual platform may benefit unilaterally from changing its algorithm and losing engagement, the collective result can be a less-informed and increasingly polarized society. 

Now, the golden question remains: is there a solution to the prisoner’s dilemma? In a single game, there is not. However, in iterative scenarios where the players repeatedly play, there are several. In the famous “Tit for Tat” approach, both players initially agree to cooperate, but one player may mirror their opponent’s strategy in following rounds, thus rewarding cooperative decisions with matching cooperative moves while also reciprocating betrayals. Thus, the prisoner’s dilemma argues that winning alone may not be the best outcome, but finding a way to win together instead. After all, what good is winning the game if everyone ends up losing?