# Prisoner's Dilemma

## Definition of Prisoner's Dilemma:

The prisoner’s dilemma is used in game theory to illustrate how two decision-makers can rationally make a decision that makes them worse off when decisions are made independently and simultaneously by each party.

## Detailed Explanation:

Game theory is a branch of mathematics that analyzes decision making when a player’s outcome—and level of satisfaction-- is influenced by decisions made by other players. Many of the choices we make every day are influenced by the decisions made by others. In some cases, we can behave rationally, and reach a decision that is not the best outcome. The prisoner’s dilemma is frequently used to illustrate this possibility.

Suppose Skysha and Christina have collaborated in two crimes. The police have enough evidence to convict them of one crime, but not enough to prosecute the second crime without a confession from either party. Obviously, Skysha and Christina want to minimize their time in prison. In the classic prisoner’s dilemma example, the two criminals are questioned by the police separately. The interrogator’s strategy is to get at least one of them to confess to the second crime by negotiating a plea bargain. Each prisoner is offered a lighter sentence if she confesses. Unfortunately for the prisoners, they are unable to corroborate because they are interrogated separately so they must decide independently whether to deny or confess to committing the second crime.

The four possible outcomes are listed below, and Table 1 provides the years each prisoner would serve in each scenario.

• If Skysha and Christina both deny involvement in the second crime, neither would be charged with the second crime. However, each would be sentenced to four years in prison for the first crime. This outcome is represented by the upper left box in the table below.
• If both Skysha and Christina confess independently to committing the second crime, each would serve six years in prison. The bottom right box shows this outcome.
• If Sysha confesses and Christina denies involvement, Skysha would serve one year, and Christina would receive a ten-year sentence. This scenario is displayed in the bottom left box.
• If Christina confesses and Skysha denies involvement, then Christina would receive a one-year sentence and Skysha would serve ten years. The upper right box provides the payoffs for this possibility.
Table 1

How much does each trust the other? Would either Skysha or Christina try to reduce their sentence by confessing? The tables below identify each prisoner’s most likely decision.

Let’s first consider Skysha’s perspective. Suppose Skysha believes Christina will deny involvement in the second crime. Skysha's sentences are provided in blue under the column “Christina Denies”. Skysha will confess because she prefers serving one year in prison to four. The second column provides Skysha’s sentences if Christina confesses, so if she thinks Christina will confess, Skysha  will still confess because being incarcerated for six years is better than ten. Regardless of what Christina does, it is in Skysha’s best interest to confess to committing the second crime. This is called a dominant strategy. A dominant strategy is a strategy that always leads to the best payoff for a player, no matter what the other players do. A rational player will always play her dominant strategy. In this game, Skysha’s dominant strategy is to confess. These outcomes are circled in Table 2.

Table 2

Does Christina also have a dominant strategy? If Christina believes Skysha will deny involvement, then Christina should consider the outcomes in the first row. Christina should confess in order to reduce her sentence from four years to one year. Christina should also confess if Christina thinks Skysha will deny, because she, like Skysha, would prefer serving six years to ten years. Therefore, Christina’s dominant strategy is also confessing. Using the payoff table, we conclude that both criminals will always confess to the crime, regardless of what they believe their partner will do, resulting in each spending six years in prison. Christina’s decisions are circled in Table 3.

Table 3

Why don’t Skysha and Christina deny the second crime? After all, Skysha and Christina would each prefer being incarcerated for four years to serving six years. It is helpful to remember that each is acting independently. Neither knows what the other person will do, so each act in their own best interest. However, if either prisoner thinks the other will deny committing the second crime, that prisoner should confess to committing the crime to put the blame on the prisoner who denied. In that case, the prisoner who confessed spends only one year in prison, and the prisoner who denies spends ten years in prison! It is never the best idea to deny, even if one prisoner believes the other convict will also deny. The circled outcome in Table 4 is the most likely outcome and is referred to as a Nash equilibrium. A Nash equilibrium is an outcome when no player can change his or her strategy for personal gain – assuming each player’s decision remains unchanged.

Table 4

## Dig Deeper With These Free Lessons:

Game Theory
Market Structures II - Monopolistic Competition and Oligopoly
Market Structures I - Perfect Competition and Monopoly
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://www.higherrockeducation.org/glossary-of-terms/prisoners-dilemma", "fetch_time": 1553302083000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2019-13/segments/1552912202704.58/warc/CC-MAIN-20190323000443-20190323022443-00182.warc.gz", "warc_record_offset": 789324713, "warc_record_length": 8367, "token_count": 1047, "char_count": 5353, "score": 4.15625, "int_score": 4, "crawl": "CC-MAIN-2019-13", "snapshot_type": "longest", "language": "en", "language_score": 0.9595733880996704, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00010-of-00064.parquet"}