Sleeping Beauty on Monty Hall

: Inspired by the Monty Hall Problem and a popular simple solution to it, we present a number of game-show puzzles that are analogous to the notorious Sleeping Beauty Problem (and variations on it), but much easier to solve. We replace the awakenings of Sleeping Beauty by contestants on a game show, like Monty Hall’s, and increase the number of awakenings/contestants in the same way that the number of doors in the Monty Hall Problem is increased to make it easier to see what the solution to the problem is. We show that these game-show proxies for the Sleeping Beauty Problem and variations on it can be solved through simple applications of Bayes’s theorem. This means that we will phrase our analysis in terms of credences or degrees of belief. We will also rephrase our analysis, however, in terms of relative frequencies. Overall, our paper is intended to showcase, in a simple yet non-trivial example, the efﬁcacy of a tried-and-true strategy for addressing problems in philosophy of science, i.e., develop a simple model for the problem and vary its parameters. Given that the Sleeping Beauty Problem, much more so than the Monty Hall Problem, challenges the intuitions about probabilities of many when they ﬁrst encounter it, the application of this strategy to this conundrum, we believe, is pedagogically useful.


Warm-up Exercise: The Three Stooges on Monty Hall
Consider the following puzzle. In a special edition of his famous game show, "Let's Make a Deal", Monty Hall calls the Three Stooges to the stage and has them collectively pick one of three doors, D 1 , D 2 or D 3 . Behind one are two checks for a thousand dollars each, behind the other two is a goat. The Three Stooges pick D 2 . Before the show goes to a commercial break, Monty tells his special guests that either one or two of them will be called back after the break. If they were wrong, only one of them will return (but he does not tell them which one); if they were right, the other two will. During the break, the Three Stooges are made to take a nap backstage. When the show resumes, they are sound asleep.
If the checks are not behind D 2 , Monty wakes up Curly and brings him back to the stage, making sure he has no idea whether he is the first or the second one to be woken up and brought back. As usual, Monty opens either D 1 or D 3 (whichever one has a goat behind it) and offers Curly to switch from D 2 to the other door that remains unopened. If the door he chooses has the two checks behind it, he gets one of them. If not, he goes home empty-handed.
If the checks are behind D 2 , Monty goes through this same routine twice, with Moe and Larry (not necessarily in that order), the only other difference being that he now has a choice whether to open D 1 or D 3 . Monty makes sure that neither of them finds out whether they were woken up and brought back first or second (at least not until Monty opens the door with the checks behind it, one of which may be gone at that point).
thirders. The debate between halfers and thirders has long moved beyond this clash of intuitions upon first encountering the problem. We strongly suspect that it persists mainly because it is ambiguous exactly what Sleeping Beauty is being asked. 3 In order get a better handle on the Sleeping Beauty Problem and inspired by the Monty Hall Problem, we design a game-show proxy for it, in which (potential) contestants take over the role of (potential) awakenings. Our analysis will show that both halfers and thirders are right, depending on how one interprets the question Sleeping Beauty is asked. That said, our game-show proxy will be much more congenial to thirders than to halfers as it implements the interpretation of the question they would consider to be the interesting one. Should the information that Sleeping Beauty is given ahead of time about what will happen depending on the outcome of one toss of a fair coin change her degree of belief upon being awakened that this particular coin toss resulted in heads? Upon a little reflection, both halfers and thirders will agree that if that is the question, Sleeping Beauty would be just as mistaken to ignore this information as contestants on "Let's Make a Deal" would be to ignore the information Monty Hall is giving them by opening one of the three doors.
Just as Sleeping Beauty knows how a coin toss will decide how many of her potential awakenings will become actual awakenings, potential contestants in our game-show proxy know how a coin toss will decide how many of them will become actual contestants. Sleeping Beauty and our potential contestants are both asked to assess (one way or another) the probability that this coin toss resulted in heads when woken up or selected as a contestant, respectively. Using Bayes's rule, 4 they should update their degree of belief that the coin came up heads in light of the information about how potential awakenings/contestants become actual awakenings/contestants. In the spirit of a time-honored Bayesian tradition (based on the principle that you put your money where your mouth is), we will cash out the degrees of belief of our game-show contestants in terms of betting behavior. 5 If our contestants update according to Bayes's rule (and the same is true for Sleeping Beauty), their prior degrees of belief, determined by the symmetry of the coin, get replaced by posterior degrees of belief that are determined by the numbers of contestants (awakenings) selected for the two possible outcomes of the coin toss-1 for heads, 2 for tails in the original problem but those numbers can be chosen arbitrarily. Although the paper is mostly written in terms of credences or degrees of belief, the analysis does not require this interpretation of probabilities. It can easily be rephrased in terms of relative frequencies in long series of repetitions of our game show.
Similar game-show proxies can be designed for variations on the Sleeping Beauty Problem, in which the coin toss is replaced by a different stochastic experiment with an arbitrary number of outcomes and arbitrary numbers of candidates (awakenings) for different outcomes. As in the case of the Monty Hall Problem, a good way to shore up one's intuitions in dealing with the Sleeping Beauty Problem, as we will see in Sections 3 and 4, is to vary these parameters. In Section 5, we illustrate this strategy for getting a handle on the Sleeping Beauty Problem by designing a game-show proxy for a variation on the problem that combines it with the Monty Hall Problem (for arbitrary numbers of doors 3 The Sleeping Beauty Problem is due to Elga [1], who took the thirder position. His paper provoked a response by Lewis [2], who took the halfer position. For an up-to-date review of the professional literature on the Sleeping Beauty Problem, see Cisewski et al. [3]. As Albert Einstein wrote to the Italian mathematician Tullio Levi-Civita on August 2, 1917: "It must be a pleasure to ride through these fields on the steed of real mathematics, while the likes of us have to muddle through on foot" (Es muss hübsch sein, auf dem Gaul der eigentlichen Mathematik durch diese Gefilde zu reiten, während unsereiner sich zu Fuss durchhelfen muss) ( [4], Doc. 368). Cisewski 2016 et al. throw everything and the kitchen sink at Sleeping Beauty. The only mathematical tool we will use is Bayes's theorem. For the use of Bayesian reasoning in connection with both the Sleeping Beauty Problem and the Monty Hall Problem, see the dissertation by Bradley [5]. and awakenings). The scenario with the Three Stooges in Section 1 is essentially our game-show proxy for this combined problem for three doors and three awakenings. In Section 6, we use the game-show proxy for the combined problem to tweak the so-called 50-50 lifeline in the TV show "Who wants to be a millionaire?" In this game show, unlike the preceding ones, the degrees of belief used as priors in our Bayesian analysis no longer reflect symmetries of physical systems. However, the analysis can still easily be rephrased in frequentist terms.

Game-Show Proxies for (Variations on) the Sleeping Beauty Problem
We introduce a new game show loosely modeled on Monty Hall's "Let's make a deal". The show starts with the host selecting (not necessarily randomly) a pool of N potential contestants from the audience. These potential contestants are carefully sequestered before the host proceeds to perform a simple stochastic experiment with n equiprobable outcomes O i (i = 1, . . . , n): flipping coins, rolling fair dice, spinning a roulette wheel, drawing numbered balls from a bingo cage, drawing cards from a deck, etc. Different stochastic devices can be used in different versions or different episodes of the show. Depending on the outcome of the experiment, the host then calls up, one by one, one or more of the N potential contestants to become actual contestants. Each contestant 6 is given a certain amount of money, say a thousand dollars, to place a bet, at even odds, 7 on one of the n possible outcomes of the experiment the host just performed (that very experiment, not a repetition of it). If they are right, they go home with two thousand dollars; if they are wrong, they go home empty-handed.
If contestants were randomly selected from the initial pool of N candidates, their chances of winning the bet would be 1/n regardless of which outcome O i they choose to put their money on. This probability is simply determined by symmetries of the physical object(s) used in the stochastic experiment. As long as he or she does not know anything about the selection procedure, a contestant's degree of belief that the outcome was O i should be 1/n for all i. In Bayesian terms, these should be his or her prior degrees of belief or priors for short: However, in our game show, the selection procedure is anything but random and all candidates know that it is not. Here is how it works. At the beginning of the show the candidates are divided into groups assigned to different outcomes. The sizes of these groups will be different for different outcomes. The candidates are told the sizes of the groups for all outcomes, but they are not told in which group they are. Candidates become contestants if and only if they happen to be in the group for the actual outcome of the stochastic experiment. The host will call up all members of this group, one by one, to place their bet.
To make sure that a candidate, when selected as a contestant, knows neither the outcome of the stochastic experiment nor whether any other candidates have already been called up as contestants, all of the candidates are put into individual soundproof booths after the host has explained to them how contestants will be selected but before he carries out the stochastic experiment (see Figure 1). When a booth's door is closed, the candidate inside cannot detect in any way what is going on outside of it. The candidates are given the sizes of the groups for all outcomes before they are sent to their booths.
Each booth is equipped with a buzzer to let the candidate inside know that she has been selected as a contestant. The candidate-turned-contestant then leaves her booth, closes the door behind her, places the bet, and finds out whether she lost or won. Unless she is the final contestant, she is only allowed to watch the rest of the show from a place where the contestants coming after her cannot see or hear her (or detect her presence in any other way). Once all members of the group of candidates selected as contestants have placed their bets, the remaining candidates are allowed to leave their booths and the show is over. How can the candidates take advantage of the information they are given about the selection of contestants to improve their chances of winning their bets when selected as a contestant?
Let N i be the number of candidates in the group assigned to the outcome O i . These N i 's can be any non-negative integers that add up to the total number of candidates N. Of course, the number of candidates will itself be a number chosen by the producers of the show. Note that one or more N i 's can be zero. If N j = 0 and O j happens to be the result of the stochastic experiment, no candidates will become contestants. That is not a problem. The host can simply repeat the stochastic experiment until he gets an outcome O k for which N k = 0. We can think of the instances in which the stochastic experiment produces a result O j , for which N j = 0 as runs of the game where the game is over before contestants are called to the stage.
The candidates can use Bayes's rule to update the priors in Equation (1) to take into account the information they are given about how candidates are selected to become contestants and use their posterior degrees of belief (or posteriors for short) when deciding which outcome to put their money on if and when actually selected as a contestant. They can do this updating as soon as they have been given the group sizes N i , even though their beliefs do not really matter unless and until they become contestants (see Figure 2).
We will first do this Bayesian updating for the simple case in which the stochastic experiment is a single coin toss. We then generalize the results to arbitrary stochastic experiments with n equiprobable outcomes.
For a single toss of a fair coin, we have H and T stand for 'Heads' and 'Tails', respectively. N H and N T are the number of candidates in the groups for heads and tails, respectively. These should add up to the total number of candidates, N. The prior degrees of belief for any candidate that the coin will come up heads or tails, respectively, are: We need to calculate the posteriors Pr(H | A) and Pr(T | A), where A stands for actual as opposed to potential contestant and is defined as A = I, a candidate, have been selected as a contestant, aware of the protocol for selecting candidates to become contestants. Because we have equal priors, we can use the simple version of Bayes's rule to calculate the posteriors: 8 The evaluation of the posteriors thus comes down to the evaluation of the so-called likelihoods Pr(A | H) and Pr(A | T).
One might be tempted to set Pr(A | H) = Pr(A | T) = 1/2 on the argument that the probability of any candidate being selected as a contestant is 1/2, regardless of the outcome of the coin toss. In that case, we would also have Pr(H | A) = Pr(T | A) = 1/2. We would be ignoring the information, however, that different numbers of candidates will become contestants depending on the outcome 8 These formulas follow from the general multiplication rule for the probability of a conjunction of two outcomes, the law of total probability, and the equiprobability of H and T. of the coin toss, which is part of the statement A. That information thus also needs to be taken into account.
If the coin came up heads (H) and the candidate is selected as a contestant (which is entailed by A), she must be one of the members of the group for heads. Thus, the likelihood Pr(A | H) is equal to the probability that she belongs to that group. Great precautions have been taken to make sure that, as far as she can tell, she could be any one of the N candidates. The probability that she (or any other candidate) belongs to the group for heads is therefore simply the number of candidates N H in that group divided by the total number of candidates N. A similar argument can be given for Pr(A | T). Hence, 9 Pr inserting these expressions in Equation (4), we arrive at These posteriors replace the equal priors in Equation (3). In the case of equal priors (we will see in Section 4 that we have to be more careful in the case of unequal priors), the procedure for selecting contestants from an initial pool of candidates thus has the effect of replacing the priors, determined by the symmetry of the coin, by posteriors determined by the choice of the sizes N H and N T of the two groups into which the initial pool of N candidates are divided. What Equation (6) shows then is that the producers of the show can basically change the (equal) priors to any posteriors they like. Because the posteriors in Equation (6) only depend on N H and N T , candidates will already know as they are sitting in their booths waiting for the buzzer to go off, whether they will choose heads or tails, should they be called up as contestants. If N H > N T , they choose heads. If N T > N H , they choose tails. If N H = N T = N/2, they get no information that would increase their chances of winning their bet. For N H = N (or, similarly, N T = N), finally, the game becomes trivial: all contestants would be guaranteed to win. If the coin comes up heads, the host calls up all contestants; if it comes up tails, he just flips it again.
The same conclusions can be reached when we conceive of probabilities in terms of relative frequencies rather than degrees of belief. Imagine that this version of our game show (with the same coin, the same pool of N potential contestants, and the same numbers N H and N T ) is repeated X times (with X a very large integer). Now, put yourself in the shoes of an arbitrary potential contestant. You expect to be selected as a contestant in about N H /N of the roughly X/2 runs of the show in which the coin will come up heads and in about N T /N of the roughly X/2 runs in which the coin will come up tails (if N H = 0 or N T = 0 the show will be over without any contestants being selected in roughly X/2 runs and you will be selected as a contestant in the roughly X/2 remaining runs). Overall, you thus expect to be selected as a contestant in about runs. Because N H + N T = N, Equation (7) confirms that, overall, you expect to be selected as a contestant in about half of the X runs. However, Equation (7) also shows that, if N T > N H , you expect to be a candidate in runs where the coin comes up tails more often than in runs in which the coin 9 Here is a more formal statement of this argument. Let G H (G T ) stand for "I, a candidate, have been put in the group associated with the outcome H (T)". The law of total probability (cf. note 8) then allows us to write: where, in the last step, we used that Pr(A | H, G H ) = 1 and Pr(A | H, G T ) = 0.
comes up heads. In other words, that you (or any other potential contestant) should use Equation (6) and set the probabilities Pr(H | A) or Pr(T | A) equal to N H /N < 1 2 and N T /N > 1 2 , respectively, is simply to take into account this sampling bias.
These results can readily be extended to arbitrary stochastic devices with n equiprobable outcomes O i (i = 1, . . . , n). The prior degrees of belief for any candidate that the experiment will result in O i are For each outcome O i , there will be N i ≥ 0 potential candidates (the host will repeat the stochastic experiment until he gets an outcome O j for which N j = 0). Because we have equal priors, we can use the simple version of Bayes's rule to calculate the posteriors: The candidate's knowledge about the selection procedure tells him or her that the likelihoods are given by (cf. Equation (5) and the reasoning leading up to it) 10 Inserting this expression for the likelihoods on the right-hand of Equation (9), we see that Equation (6) generalizes to: Once again, we see that the protocol for selecting contestants from an initial pool of candidates has the effect of replacing (equal) priors (see Equation (8)), determined by symmetries of the stochastic device used, by posteriors (see Equation (11)) determined by the choice of the numbers N i , which are only subject to the requirement that they add up to N, the number of candidates we started out with. Like Equation (6), Equation (11) can be seen as expressing a certain sampling bias. Imagine that this version of our game show (with the same stochastic device, the same pool of N potential contestants, and the same set of numbers {N i }) is repeated X times (with X a very large integer). Put yourself in the shoes of an arbitrary potential contestant in these X runs of the game. Suppose there are m < n outcomes O j for which N j = 0. That means that in roughly m(X/n) runs of the game, no contestants are selected. In the remaining (n − m)(X/n) runs, you will be selected as a contestant in about N i /N of the roughly X/n runs in which the outcome of the stochastic experiment is O i . Overall, you will thus be selected in about runs. Because ∑ n i=1 N i = N, Equation (12) confirms that you expect to be selected as a contestant in about X/n runs overall. However, Equation (12) also shows that, if N k > N l > 0, you expect to be a candidate in runs with outcome O k more often than in runs with outcome O l . In other words, 10 Once again (see note 9), this follows from the rule of total probability. Let G i stand for "I, a candidate, have been put in the group associated with the outcome O i ." We then have: where we have used that Pr(A | O i , G j ) = δ ij (where δ ij is the Kronecker delta, defined as δ ij = 1 for i = j and δ ij = 0 for i = j) and Pr(G j ) = N j /N. that you (or any other potential contestant) should use Equation (11) and choose a value other than 1/n for the probability Pr(O i | A) is simply to take into account this sampling bias.

Game-Show Proxy for the Original Version of the Sleeping Beauty Problem
Our proxy for the Sleeping Beauty Problem is a special case of the game show analyzed with malice aforethought in Equations (2)-(7) in Section 3. It is a version or episode of the show in which the stochastic experiment is a single toss of a fair coin. We analyzed this game show for an arbitrary number of candidates N divided into groups for heads and tails, containing N H and N T candidates, respectively. To turn this into a proxy for the Sleeping Beauty Problem, we set N = 3 (the minimum number of candidates for which this version of the show is non-trivial) and N H = 1.
Thus, the parameters N H , N T and N introduced in Equation (2) have the values: Candidates (potential contestants; cf. note 6) are the analogues of potential awakenings. The one candidate selected to become a contestant if the coin comes up heads is the analogue of the one potential awakening of Sleeping Beauty that becomes an actual awakening if the coin comes up heads. The two candidates selected to become contestants after the coin comes up tails are the analogues of the two potential awakenings that become actual awakenings if the coin comes up tails. The drugging of Sleeping Beauty ensures that during subsequent awakenings she knows as little about preceding awakenings as any candidate emerging from his or her booth to become a contestant knows about other candidates in the game-show proxy for the Sleeping Beauty Problem.
It may seem that there is still an important difference between candidates or potential contestants and potential awakenings. It is easy to tell potential contestants apart: we could use their Social Security Numbers (SSNs), for instance. Every potential contestant will presumably know, at all times, what his or her SSN is. How can we tell Sleeping Beauty's potential awakenings apart? How can Sleeping Beauty herself tell her own potential awakenings apart? Fortunately, these questions have easy answers. We can specify, for any potential awakening, at what time and on what date it will happen if it will happen at all (allowing ten minutes or so for each awakening). We then put a clock that displays both time and date in the room where Sleeping Beauty is awakened so that she can tell, every time she is woken up, which potential awakening has just become an actual awakening. Just as we had no need to refer to a potential candidate's SSN, we will have no need to refer to date and time of a potential awakening. The point is that, at least in principle, individuating potential awakenings is no more problematic than individuating potential contestants. 11 This way of providing potential awakenings with a time stamp should not be conflated with the time stamps used in the standard version of the Sleeping Beauty Problem. There Sleeping Beauty is told ahead of time that she will be woken up a second time on Tuesday if the coin comes up tails. In that case, Sleeping Beauty, when awakened, can obviously not be allowed to find out what day of the week it is (at least not until she has answered the question what her degree of belief is that the coin came up heads). In our version, she is only told that two of the three potential awakenings (labeled by the time and date they will happen) will become actual awakenings if the coin comes up tails. She is not told which two. In that case, the date and the time she is awakened are as irrelevant to Sleeping Beauty's assessment of her degree of belief that the coin came up heads as the SSN of a potential contestant in our game-show proxy is to his or her calculation of the posteriors Pr(H | A) and Pr(T | A) (see Equations (4)-(6)).
Sleeping Beauty has no reason to doubt that the coin used to determine whether she will be woken up once or twice is fair. In other words, her prior degree of belief that the coin will come up heads should be Pr(H) = 1 2 .
What should Sleeping Beauty's degree of belief be, once she is woken up, that the particular toss of this coin that decided how many times she would be awakened resulted in heads? In Bayesian terms, what is her posterior Pr(H | A)? Here A (which, as before, stands for actual as opposed to potential) is defined as A = I, Sleeping Beauty, have been awakened, aware of the protocol governing which of my potential awakenings become actual awakenings.
With this reinterpretation of A and using the values of the parameters in Equation (13), we can use the first half of Equation (6) for Sleeping Beauty's posterior degree of belief that the coin came up heads: This follows directly from Equation (5)

for the likelihoods Pr(A | H) and Pr(A | T).
Because this is the crux of the matter, we transfer the reasoning leading up to Equation (5) back to the Sleeping Beauty Problem (see also note 9). We do so for arbitrary values of N H and N. If the coin came up heads (H) and she has been awakened aware of the protocol for selecting awakenings (A), Sleeping Beauty knows that her present awakening must be one of the N H potential awakenings that become actual awakenings if the coin came up heads. Thus, the likelihood Pr(A | H) is equal to Sleeping Beauty's degree of belief that her current awakening is one of those N H potential awakenings. Great precautions have been taken to make sure that Sleeping Beauty, when she awakes, has no way of telling whether her current awakening is one of the N H potential awakenings should the coin come up heads or one of the N T potential awakenings should the coin come up tails. The probability that her current awakening is one of the former is therefore simply the number N H of such potential awakenings divided by the total number N of all potential awakenings.
In Section 2, we noted that the Monty Hall Problem becomes more intuitive if the number of doors is increased. The solution to the Sleeping Beauty Problem likewise becomes more intuitive if the number of potential awakenings or, in our game-proxy for the problem, the number of potential contestants is increased. Instead of the values in Equation (13), we choose In this case, Equation (15) tells us that Sleeping Beauty's degree of belief that the coin came up heads plummets from its initial value of 1/2 to just 1/100. Like Equation (6) and Equation (11), Equation (15) can be seen as expressing a certain sampling bias. Imagine that we repeat the experiment with Sleeping Beauty X times where X is some very large integer. In the roughly X/2 runs in which the coin comes up heads, the total number of awakenings of Sleeping Beauty will be N H (X/2). In the roughly X/2 runs in which the coin will come up tails, the total number of awakenings will be N T (X/2). In all runs combined, the total number of awakenings will, thus, be about N H (X/2) + N T (X/2) = N(X/2). If N T > N H , more of these awakenings occur during runs in which the coin comes up tails than during runs in which the coin comes up heads. That Sleeping Beauty uses Equation (15) to set the probability Pr(H | A) equal to N H /N = 1 2 is simply to take into account this sampling bias.
Equation (15) shows that, as long as our game show can be used as a proxy for the Sleeping Beauty Problem, the thirders are right and the halfers are wrong. However, there is a simple way of reconciling the two positions. Once again, imagine that the experiment with Sleeping Beauty is repeated many times. Ask Sleeping Beauty to answer the following pair of questions: 12 Question #1: What is the probability that in an arbitrarily chosen run the coin comes up heads?
Answer: 1/2. Question #2: What is the probability that an arbitrarily chosen awakening happens during a run in which the coin comes up heads? Answer: N H /N (which works out to 1/3 for the values given in Equation (13)).
One can debate-and commentators have (see notes 2 and 3)-whether question #1 or question #2 is the more natural way of interpreting the question in the original Sleeping Beauty Problem and whether the problem doesn't become trivial once you accept that halfers and thirders are just interpreting it differently. We will not get into those debates. We simply note that, although both questions are relevant to our game-show proxy (the answer to question #2 presupposes the answer to question #1), it is the second question that makes this game show and others like it intrinsically interesting or, at least, amusing to contemplate.

Switch or Stay? Sleeping Beauty on Monty Hall
Suppose that Sleeping Beauty is a contestant in a special episode of Monty Hall's "Let's Make a Deal". Monty asks her to choose between doors D 1 , D 2 and D 3 . Behind one, he tells her, are two checks for a thousand dollars each; behind the other two is a goat. Sleeping Beauty chooses D 2 . Monty offers her the usual deal but with a twist. The twist is that he will only open one of the other doors (as usual we assume that Monty knows which door has the checks behind it and that he will always open a door with a goat behind it) and give her the opportunity to switch after she's been put under and woken up, possibly twice (in which case he will have to administer an amnesia drug the first time). Every time she is awakened she is offered the same deal and Monty Hall will open one of the doors (not necessarily the same one each time) and offer her to switch. If Sleeping Beauty was right the first time and the checks are behind D 2 , she will be woken up twice. If she was wrong the first time and the checks are behind D 1 or D 3 , she will only be woken up once. That she might have to be drugged once, Monty tells her, is well worth it, as she will get one of the checks each time she picks the right door and could, thus, conceivably walk away with two thousand dollars.
Sleeping Beauty takes the deal. When awakened, should she switch doors, should she stay with the one she originally picked, or should she be indifferent between switching and staying?
The special episode of "Let's Make a Deal" with the Three Stooges in Section 1 is essentially our game-show proxy for this Sleeping Beauty on Monty Hall Problem. The only difference is that instead of being made to take a nap backstage like the Three Stooges, our potential contestants will all be put in booths, like the ones that we used in the game show introduced in Section 3. Figure 3 illustrates this particular format of the new game show.
As in Section 1, we assume the three candidates initially pick D 2 . They are now divided into two groups. Two of them are assigned to D 2 , one of them is assigned to the other two doors. This makes the format of the game show significantly different from the one we introduced and analyzed in Section 3. There all candidates were assigned to one of n equiprobable outcomes O i . In this case, they are assigned to non-equiprobable outcomes. This means that we can no longer use the simple form of Bayes's rule (for equal priors). We need to use the general form (for unequal priors). Other than that, however, the analysis is completely analogous to the analysis in Section 3.
The priors are: We have three candidates divided into two groups (one of two, one of one) assigned to these two outcomes: The likelihoods are (cf. Equation (5) and the reasoning leading up to it): where A is defined as in Section 3 as "I, a candidate, have been selected as a contestant, aware of the protocol for selecting candidates to become contestants". The posterior Pr(D 2 | A) is given by (the general form of) Bayes's rule (cf. note 8): The posterior Pr(not-D 2 | A) has the same denominator but Pr(A | not-D 2 ) Pr(not-D 2 ) in the numerator. From Equations (18) and (20), we see that which means that Thus, the sampling bias introduced by our peculiar procedure of selecting contestants from an initial pool of candidates wipes out the advantage of switching doors a contestant would have had in a regular episode of "Let's Make a Deal". Replacing the three potential contestants by three potential awakenings, we conclude that Sleeping Beauty should be indifferent between staying with the door she initially picked and switching to the one other door that remains unopened.
Of course, we can just as easily create a version of the Sleeping Beauty on Monty Hall Problem in which she increases her chances of picking the right door from 1/3 to 2/3 by staying. To do that, we replace the values of N D 2 , N not-D 2 and N in Equation (19) by In this case, we need, say, the Jackson Five rather than the Three Stooges (and four checks of a thousand dollars). Inserting the numbers in Equation (24) into Equation (20) for the likelihoods, we find Inserting Equation (18) for the priors and Equation (25) for the likelihoods into Equation (21) for the posterior Pr(D 2 | A), we find In this case, our contestants and, hence, Sleeping Beauty should stay with D 2 . These results can easily be generalized from 3 to n doors (in which case we will need still more checks and Monty Hall will have to open n − 2 doors before offering the contestant to switch). We will do this only for the case that contestants (and, hence, Sleeping Beauty) should be indifferent between switching and staying. In that case, we need N = n candidates (and n − 1 checks). Suppose they collectively pick the j th door. We can now basically repeat the steps in Equations (17)-(23). The two (non-equiprobable) outcomes are: D j = Checks behind j th door, not-D j = Checks not behind j th door.
The priors are: The sizes of the groups assigned to these two outcomes are: The likelihoods are: The posterior Pr(D j | A) is: The posterior Pr(not-D j | A) has the same denominator, but Pr(A | not-D j ) Pr(not-D j ) in the numerator. From Equations (28) and (30), we see that which means that In other words, contestants in this game (and Sleeping Beauty in the variation on the Sleeping Beauty Problem for which this game show is a proxy) should be indifferent between staying and switching. The design of a game-show proxy for this variation on the Sleeping Beauty Problem nicely illustrates how such game shows can be used to get a better handle on such puzzles.

Switch or Stay? A Variation on the 50:50 Lifeline in "Who Wants to Be a Millionaire?"
In this section, we introduce and analyze one last variation of the game shows that we used in Sections 3-5 to analyze the Sleeping Beauty Problem and generalizations of it. In those sections, the priors in Bayes's theorem were determined by symmetries of various physical systems. All else being equal, the odds of a fair coin landing heads or tails are 50/50 and one door is as likely as the other two to have the prize behind it. In the game show to be considered in this section, however, the priors will be degrees of belief that do not reflect such symmetries. In Sections 3 and 4, we showed that our analysis works regardless of whether we think of probabilities as relative frequencies or as degrees of belief. This remains true in this section. There is a simple way to represent some agent's degree of belief in some proposition A in frequentist terms. Imagine we ask our agent to place a bet (at even odds) on A or not-A. If she reports her degree of belief in A to be 0 ≤ x ≤ 1, she should be prepared to spin a wheel of fortune with a pie chart printed on it with a portion 2πx corresponding to A and a portion 2π(1 − x) corresponding to not-A and pick A or not-A based on where the marker of this wheel of fortune lands.
The specific game show we will examine in this section was inspired by the 50:50 lifeline of the popular TV show "Who Wants to Be a Millionaire?". Our variation on this show calls for groups of at least three contestants. Here is how it works. Regis Philbin, the host of the most successful incarnation of "Who Wants to Be a Millionaire?", asks the group of contestants some trivia question and gives them four answers to choose from. They collectively have to pick one.
Regis informs them that they have been divided into two groups ahead of time. They are told the sizes of these two groups, (where the subscripts 'r' and 'w' stand for 'right' and 'wrong', respectively), but not in which group they are. Regis then asks all contestants to go to one of the soundproof booths familiar from the game shows examined in Sections 3-5. If the answer they chose is right, Regis explains to the contestants before they all go into their booths, he will bring back, one by one, all those in the group with N r contestants; if their initial answer is wrong, he will bring back, one by one, all of those in the group with N w contestants. Every time Regis brings back a contestant, he eliminates two of the three answers not initially chosen (not necessarily the same two for every contestant) and offers the contestant a choice between the answer i initially chosen and the one remaining alternative answer not-i. As should be clear from the analysis in Section 5 (and as we will verify in detail below), a contestant will be more likely to stick to i than she otherwise would have been if N r > N w and more likely to switch to not-i if N r < N w .
Contestants whose final answer is wrong and contestants who are not called back at all are eliminated from the game. Regis then repeats the procedure described above with a new trivia question and a reduced number of contestants. He keeps repeating it until there is only one contestant left, who is then declared the winner of the game (when it gets down to two contestants, N r = N w = 1 and the condition N r = N w is dropped).
Which answer a contestant chooses when she is called back to give her final answer depends on the probabilities Pr(i) and Pr(not-i) she assigns to the answers i and not-i. 13 Unlike the doors in the Monty Hall Problem, different answers will, in general, be assigned different initial probabilities. Moreover, these probabilities will, in general, be different for different contestants. Priors and posteriors in this case clearly represent degrees of belief rather than relative frequencies, even though, as we pointed out at the beginning of this section, they can still be interpreted either way.
The posterior Pr(i|A) is given by an equation that is similar to Equations (31): where A is defined as "I have been called back to give my final answer aware of the protocol determining which contestants are called back to do so". Using expressions similar to those in Equations (30) for the likelihoods, and inserting 1 − Pr(i) for Pr(not-i), we can rewrite the posterior as: as long as N r = N w and Pr(i) is not equal to 0 or 1, the posterior differs from the prior.
We now ask what the minimum value of Pr(i) must be for a contestant to choose the answer i over the answer not-i. Thus, we are looking for values of the prior such that the posterior is greater than 1 2 . Equation (37)  This shows that the order in which a Bayesian agent updates on e 1 and e 2 does not matter. Whether this is or should also be true for a contestant in our game show evaluating the hypothesis h under consideration here in light of the two specific pieces of evidence e 1 and e 2 is a question that we leave open (one could likewise wonder whether it does or should remain true if e 1 and e 2 are the outcomes of measurements of two observables represented by non-commuting operators in quantum mechanics). We only analyze the updating on e 2 in Bayesian terms. Thus, the prior Pr(i) in this application of Bayes's rule is in the notation of this footnote, Pr(h|e 1 ), with h = i. 14 Substituting x ≡ Pr(i) (with 0 < x < 1) on the right-hand side of Equation (37) and asking when the resulting expression is greater than 1 2 , we find that N r x > 1 2 ((N r − N w ) x + N w ) or 1 2 (N r + N w ) x > 1 2 N w , from which Equation (38) follows. From equations similar to Equations (35)-(37), it follows that Pr(not-i | A) > 1 2 as long as Pr(not-i) > N r /N. is that i is the correct answer. If Pr(i) > N w /N, she should stay with i. If Pr(i) < N w /N, she should switch to not-i. If Pr(i) = N w /N, she should be indifferent between staying and switching. Thus, the producers of the show can ensure that the selection mechanism boosts a value as low as 1/N for Pr(i) to a value of 1 2 for Pr(i | A) by choosing N w = 1 and N r = N − 1. By choosing N r = 1 and N w = N − 1, they can likewise ensure that Pr(not-i) = 1/N gets boosted to Pr(not-i | A) = 1 2 . "Who Wants to Be a Millionaire?" could thus get a new lease on life by borrowing some ideas from Sleeping Beauty and Monty Hall.

Conclusions: Game Shows and Pedagogy
As one of us can attest on the basis of actual teaching experience (cf. note 1), the game shows introduced and analyzed in this paper make for effective pedagogical tools in introductory undergraduate courses in philosophy of science. They nicely illustrate how one can get a handle on an easy-to-grasp yet non-trivial problem by (a) modeling it in a way that avoids one of its most confusing aspects (the problem of "self-locating beliefs", which evaporates once awakenings are replaced by contestants); (b) varying the parameters of the model (the solution is much easier to see for larger numbers of awakenings/contestants); and, (c) recognizing that the problem is just one in a much broader class of similar problems (the coin flip can be replaced by rolling dice, drawing a ball from a bingo cage, spinning a roulette wheel, or what have you). Our solution of the Sleeping Beauty Problem also provides an instructive example of applying Bayes's rule. In this particular application, the main challenge is to articulate exactly what one should conditionalize on when updating one's degree of belief. Using different versions of our game show, we highlighted the difference between the simple and general form of Bayes's rule (for equal and unequal priors, respectively [cf. note 4]). We analyzed all versions of our game show both in terms of degrees of belief and in terms of relative frequencies, thus helping students to appreciate the difference between these two conceptions of probability in some concrete examples. Given these pedagogical benefits, we hope that other instructors will try out these game shows in their classes. If they do, we hope that they and their students will have as much fun with them as we have had.