# 13.6: The Monty Hall Problem

- Page ID
- 10260

## Preliminaries

### Statement of the Problem

The Monty Hall problem involves a classical game show situation and is named after Monty Hall, the long-time host of the TV game show Let's Make a Deal. There are three doors labeled 1, 2, and 3. A car is behind one of the doors, while goats are behind the other two:

The rules are as follows:

- The player selects a door.
- The host selects a different door and opens it.
- The host gives the player the option of switching from her original choice to the remaining closed door.
- The door finally selected by the player is opened and she either wins or loses.

The Monty Hall problem became the subject of intense controversy because of several articles by Marilyn Vos Savant in the Ask Marilyn column of Parade magazine, a popular Sunday newspaper supplement. The controversy began when a reader posed the problem in the following way:

Suppose you're on a game show, and you're given a choice of three doors. Behind one door is a car; behind the others, goats. You pick a door—say No. 1—and the host, who knows what's behind the doors, opens another door—say No. 3—which has a goat. He then says to you,Do you want to pick door No. 2?Is it to your advantage to switch your choice?

Marilyn's response was that the contestant should switch doors, claiming that there is a \(\frac{1}{3}\) chance that the car is behind door 1, while there is a \(\frac{2}{3}\) chance that the car is behind door 2. In two follow-up columns, Marilyn printed a number of responses, some from academics, most of whom claimed in angry or sarcastic tones that she was wrong and that there are equal chances that the car is behind doors 1 or 2. Marilyn stood by her original answer and offered additional, but non-mathematical, arguments.

Think about the problem. Do you agree with Marilyn or with her critics, or do you think that neither solution is correct?

In the Monty Hall game, set the host strategy to *standard* (the meaning of this strategy will be explained in the below). Play the Monty Hall game 50 times with each of the following strategies. Do you want to reconsider your answer to question above?

- Always switch
- Never switch

In the Monty Hall game, set the host strategy to *blind* (the meaning of this strategy will be explained below). Play the Monty Hall game 50 times with each of the following strategies. Do you want to reconsider your answer to question above?

- Always switch
- Never switch

### Modeling Assumptions

When we begin to think carefully about the Monty Hall problem, we realize that the statement of the problem by Marilyn's reader is so vague that a meaningful discussion is not possible without clarifying assumptions about the strategies of the host and player. Indeed, we will see that misunderstandings about these strategies are the cause of the controversy.

Let us try to formulate the problem mathematically. In general, the actions of the host and player can vary from game to game, but if we are to have a random experiment in the classical sense, we must assume that the same probability distributions govern the host and player on each game and that the games are independent.

There are four basic random variables for a game:

- \(U\): the number of the door containing the car.
- \(X\): the number of the first door selected by the player.
- \(V\): the number of the door opened by the host.
- \(Y\): the number of the second door selected by the player.

Each of these random variables has the possible values 1, 2, and 3. However, because of the rules of the game, the door opened by the host cannot be either of the doors selected by the player, so \(V \ne X\) and \(V \ne Y\). In general, we *will* allow the possibility \(V = U\), that the host opens the door with the car behind it. Whether this is a *reasonable* action of the host is a big part of the controversy about this problem.

The Monty Hall experiment will be completely defined mathematically once the joint distribution of the basic variables is specified. This joint distribution in turn depends on the strategies of the host and player, which we will consider next.

## Strategies

### Host Strategies

In the Monty Hall experiment, note that the host determines the probability density function of the door containing the car, namely \(\P(U = i)\) for \(i \in \{1, 2, 3\}\). The obvious choice for the host is to randomly assign the car to one of the three doors. This leads to the uniform distribution, and unless otherwise noted, we will always assume that \(U\) has this distribution. Thus, \(\P(U = i) = \frac{1}{3}\) for \(i \in \{1, 2, 3\}\).

The host also determines the conditional density function of the door he opens, given knowledge of the door containing the car and the first door selected by the player, namely \(\P(V = k \mid U = i, X = j)\) for \(i, \, j \in \{1, 2, 3\}\). Recall that since the host cannot open the door chosen by the player, this probability must be 0 for \(k = j\).

Thus, the distribution of \(U\) and the conditional distribution of \(V\) given \(U\) and \(X\) constitute the host strategy.

### The Standard Strategy

In most real game shows, the host would always open a door with a goat behind it. If the player's first choice is incorrect, then the host has no choice; he cannot open the door with the car or the player's choice and must therefore open the only remaining door. On the other hand, if the player's first choice *is* correct, then the host can open either of the remaining doors, since goats are behind both. Thus, he might naturally pick one of these doors at random.

This strategy leads to the following conditional distribution for \(V\) given \(U\) and \(X\): \[ \P(V = k \mid U = i, X = j) = \begin{cases} 1, & i \ne j, \; i \ne k, \; k \ne j \\ \frac{1}{2}, & i = j, \; k \ne i \\ 0, & k = i, \; k = j \end{cases} \]

This distribution, along with the uniform distribution for \(U\), will be referred to as the standard strategy for the host.

In the Monty Hall game, set the host strategy to *standard*. Play the game 50 times with each of the following player strategies. Which works better?

- Always switch
- Never switch

### The Blind Strategy

Another possible second-stage strategy is for the host to always open a door chosen at random from the two possibilities. Thus, the host might well open the door containing the car.

This strategy leads to the following conditional distribution for \(V\) given \(U\) and \(X\): \[ \P(V = k \mid U = i, X = j) = \begin{cases} \frac{1}{2}, & k \ne j \\ 0, & k = j \end{cases} \]

This distribution, together with the uniform distribution for \(U\), will be referred to as the blind strategy for the host. The blind strategy seems a bit odd. However, the confusion between the two strategies is the source of the controversy concerning this problem.

In the Monty Hall game, set the host strategy to *blind*. Play the game 50 times with each of the following player strategies. Which works better?

- Always switch
- Never switch

### Player Strategies

The player, on the other hand, determines the probability density function of her first choice, namely \(\P(X = j)\) for \(j \in \{1, 2, 3\}\). The obvious first choice for the player is to randomly choose a door, since the player has no knowledge at this point. This leads to the uniform distribution, so \(\P(X = j) = \frac{1}{3}\) for \(j \in \{1, 2, 3\}\)

The player also determines the conditional density function of her second choice, given knowledge of her first choice and the door opened by the host, namely \( \P(Y = l \mid X = j, V = k) \) for \(i, \, j, \, k \in \{1, 2, 3\}\) with \(j \ne k\). Recall that since the player cannot choose the door opened by the host, this probability must be 0 for \(l = k\). The distribution of \(X\) and the conditional distribution of \(Y\) given \(X\) and \(V\) constitute the player strategy.

Suppose that the player switches with probability \(p \in [0, 1]\). This leads to the following conditional distribution: \[ \P(Y = l \mid X = j, V = k) = \begin{cases} p, & j \ne k, \; j \ne l, \; k \ne l \\ 1 - p, & j \ne k, \; l = j \\ 0, & j = k, \; l = k \end{cases} \]

In particular, if \(p = 1\), the player always switches, while if \(p = 0\), the player never switches.

## Mathematical Analysis

We are almost ready to analyze the Monty Hall problem mathematically. But first we must make some independence assumptions to incorporate the lack of knowledge that the host and player have about each other's actions. First, the player has no knowledge of the door containing the car, so we assume that \(U\) and \(X\) are independent. Also, the only information about the car door that the player has when she makes her second choice is the information (if any) revealed by her first choice and the host's subsequent selection. Mathematically, this means that \(Y\) is conditionally independent of \(U\) given \(X\) and \(V\).

### Distributions

The host and player strategies form the basic data for the Monty Hall problem. Because of the independence assumptions, the joint distribution of the basic random variables is completely determined by these strategies.

The joint probability density function of \((U, X, V, Y)\) is given by

\[ \P(U = i, X = j, V = k, Y = l) = \P(U = i) \P(X = j) \P(V = k \mid U = i, X = j) \P(Y = l \mid X = j, V = k), \quad i, \; j, \; k, \; l \in \{1, 2, 3\} \]## Proof

This follows from the independence assumptions and the multiplication rule of conditional probability.

The probability of any event defined in terms of the Monty Hall problem can be computed by summing the joint density over the appropriate values of \((i, j, k, l)\).

With either of the basic host strategies, \(V\) is uniformly distributed on \(\{1, 2, 3\}\).

Suppose that the player switches with probability \(p\). With either of the basic host strategies, \(Y\) is uniformly distributed on \(\{1, 2, 3\}\).

In the Monty Hall experiment, set the host strategy to *standard*. For each of the following values of \(p\), run the simulation 1000 times. Based on relative frequency, which strategy works best?

- \(p = 0\) (never switch)
- \(p = 0.3\)
- \(p = 0.5\)
- \(p = 0.7\)
- \(p = 1\) (always switch)

In the Monty Hall experiment, set the host strategy to *blind*. For each of the following values of \(p\), run the experiment 1000 times. Based on relative frequency, which strategy works best?

- \(p = 0\) (never switch)
- \(p = 0.3\)
- \(p = 0.5\)
- \(p = 0.7\)
- \(p = 1\) (always switch)

### The Probability of Winning

The event that the player wins a game is \(\{Y = U\}\). We will compute the probability of this event with the basic host and player strategies.

Suppose that the host follows the standard strategy and that the player switches with probability \(p\). Then the probability that the player wins is \[ \P(Y = U) = \frac{1 + p}{3} \]

In particular, if the player always switches, the probability that she wins is \(p = \frac{2}{3}\) and if the player never switches, the probability that she wins is \(p = \frac{1}{3}\).

In the Monty Hall experiment, set the host strategy to *standard*. For each of the following values of \(p\), run the simulation 1000 times. In each case, compare the relative frequency of winning to the probability of winning.

- \(p = 0\) (never switch)
- \(p = 0.3\)
- \(p = 0.5\)
- \(p = 0.7\)
- \(p = 1\) (always switch)

Suppose that the host follows the blind strategy. Then for *any* player strategy, the probability that the player wins is \[ \P(Y = U) = \frac{1}{3} \]

In the Monty Hall experiment, set the host strategy to *blind*. For each of the following values of \(p\), run the experiment 1000 times. In each case, compare the relative frequency of winning to the probability of winning.

- \(p = 0\) (never switch)
- \(p = 0.3\)
- \(p = 0.5\)
- \(p = 0.7\)
- \(p = 1\) (always switch)

For a complete solution of the Monty Hall problem, we want to compute the conditional probability that the player wins, given that the host opens a door with a goat behind it: \[ \P(Y = U \mid V \ne U) = \frac{\P(Y = U)}{\P(V \ne U)} \] With the basic host and player strategies, the numerator, the probability of winning, has been computed. Thus we need to consider the denominator, the probability that the host opens a door with a goat. If the host use the standard strategy, then the conditional probability of winning is the same as the unconditional probability of winning, regardless of the player strategy. In particular, we have the following result:

If the host follows the standard strategy and the player switches with probability \(p\), then \[ \P(Y = U \mid V \ne U) = \frac{1 + p}{3} \]

## Proof

This follows from the win probability above

Once again, the probability increases from \( \frac{1}{3} \) when \( p = 0 \), so that the player never switches, to \( \frac{2}{3} \) when \( p = 1 \), so that the player always switches.

If the host follows the blind strategy, then for any player strategy, \(\P(V \ne U) = \frac{2}{3}\) and therefore \(\P(Y = U \mid V \ne U) = \frac{1}{2}\).

In the Monty Hall experiment, set the host strategy to *blind*. For each of the following values of \(p\), run the experiment 500 times. In each case, compute the conditional relative frequency of winning, given that the host shows a goat, and compare with the theoretical answer above,

- \(p = 0\) (never switch)
- \(p = 0.3\)
- \(p = 0.5\)
- \(p = 0.7\)
- \(p = 1\) (always switch)

The confusion between the conditional probability of winning for these two strategies has been the source of much controversy in the Monty Hall problem. Marilyn was probably thinking of the standard host strategy, while some of her critics were thinking of the blind strategy. This problem points out the importance of careful modeling, of the careful statement of assumptions. Marilyn is correct if the host follows the standard strategy; the critics are correct if the host follows the blind strategy; any number of other answers could be correct if the host follows other strategies.

The mathematical formulation we have used is fairly complete. However, if we just want to solve Marilyn's problem, there is a much simpler analysis (which you may have discovered yourself). Suppose that the host follows the standard strategy, and thus always opens a door with a goat. If the player's first door is incorrect (contains a goat), then the host has no choice and must open the other door with a goat. Then, if the player switches, she wins. On the other hand, if the player's first door is correct and she switches, then of course she loses. Thus, we see that if the player always switches, then *she wins if and only if her first choice is incorrect*, an event that obviously has probability \(\frac{2}{3}\). If the player never switches, then she wins if and only if her first choice is correct, an event with probability \(\frac{1}{3}\).