ArticleslgStudy

mathematics

Sleeping Beauty problem

Sleeping Beauty problem is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Sleeping Beauty problem rather than just read about it. In short: The Sleeping Beauty problem, also known as the Sleeping Beauty paradox, is a puzzle in decision theory in which an ideally rational epistemic agent is told she will be awoken from sleep either once or twice according to the toss of a coin. Each time she will have no memory of whether she has been awoken before, and is asked what her degree of belief that "the outcome of the coin toss is Heads" ought to be when she i…

Sleeping Beauty problem — main illustration
Sleeping Beauty problem — illustration

Key takeaways

  • Sleeping Beauty problem belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Sleeping Beauty problem to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Sleeping Beauty problem from memory before moving on to harder problems.

Reference excerpt

The Sleeping Beauty problem, also known as the Sleeping Beauty paradox, is a puzzle in decision theory in which an ideally rational epistemic agent is told she will be awoken from sleep either once or twice according to the toss of a coin. Each time she will have no memory of whether she has been awoken before, and is asked what her degree of belief that "the outcome of the coin toss is Heads" ought to be when she is first awakened.

History The problem was originally formulated in unpublished work in the mid-1980s by Arnold Zuboff (the work was later published as "One Self: The Logic of Experience") followed by a paper by Adam Elga. A formal analysis of the problem of belief formation in decision problems with imperfect recall was provided first by Michele Piccione and Ariel Rubinstein in their paper: "On the Interpretation of Decision Problems with Imperfect Recall" where the "paradox of the absent minded driver" was first introduced and the Sleeping Beauty problem discussed as Example 5. The name "Sleeping Beauty" was given to the problem by Robert Stalnaker and was first used in extensive discussion in the Usenet newsgroup rec.puzzles in 1999. A more recent paper by Peter Winkler discussing different sides of the problem was published in The American Mathematical Monthly in 2017.

The problem As originally published by Elga, the problem was:

Some researchers are going to put you to sleep. During the two days that your sleep will last, they will briefly wake you up either once or twice, depending on the toss of a fair coin (Heads: once; Tails: twice). After each waking, they will put you back to sleep with a drug that makes you forget that waking. When you are first awakened, to what degree ought you believe that the outcome of the coin toss is Heads? There are three superficial differences between Zuboff's unpublished versions, and the one Elga actually solved (which is not quite the same as the one he asked). They should not affect the solution method. Zuboff used a large number, N, of days. There was to be one waking per day after an unspecified coin-flip result, and one waking on a random day in that interval after the other result. Elga fixed N at 2, named Tails as the result where there were to be two wakings, and placed the one waking after Heads on day 1. This has become the canonical form of the problem:

Sleeping Beauty volunteers to undergo the following experiment and is told all of the following details: On Sunday she will be put to sleep. Once or twice, during the experiment, Sleeping Beauty will be awakened, interviewed, and put back to sleep with an amnesia-inducing drug that makes her forget that awakening. A fair coin will be tossed to determine which experimental procedure to undertake: If the coin comes up heads, Sleeping Beauty will be awakened and interviewed on Monday only. If the coin comes up tails, she will be awakened and interviewed on Monday and Tuesday. In either case, she will be awakened on Wednesday without interview and the experiment ends.

Any time Sleeping Beauty is awakened and interviewed she will not be able to tell which day it is or whether she has been awakened before. During the interview Sleeping Beauty is asked: "What is your credence now for the proposition that the coin landed heads?"

Solutions This problem continues to produce ongoing debate.

Thirder position The thirder position argues that the probability of heads is 1/3. Adam Elga argued for this position originally as follows: Suppose Sleeping Beauty is told and she comes to fully believe that the coin landed tails. By even a highly restricted principle of indifference, given that the coin lands tails, her credence that it is Monday should equal her credence that it is Tuesday, since being in one situation would be subjectively indistinguishable from the other. In other words, P(Monday|Tails) = P(Tuesday|Tails), and thus

P(Tails and Tuesday) = P(Tails and Monday). Suppose now that Sleeping Beauty is told upon awakening and comes to fully believe that it is Monday. Guided by the objective chance of heads landing being equal to the chance of tails landing, it should hold that P(Tails|Monday) = P(Heads|Monday), and thus

P(Tails and Tuesday) = P(Tails and Monday) = P(Heads and Monday). Since these three outcomes are exhaustive and exclusive for one trial (and thus their probabilities must add to 1), the probability of each is then 1/3 by the previous two steps in the argument. An alternative argument is as follows: Credence can be viewed as the amount a rational risk-neutral bettor would wager if the payoff for being correct is 1 unit (the wager itself being lost either way). In the heads scenario, Sleeping Beauty would spend her wager amount one time, and receive 1 money for being correct. In the tails scenario, she would spend her wager amount twice, and receive nothing. Her expected value is therefore to gain 0.5 but also lose 1.5 times her wager, thus she should break even if her wager is 1/3.

Halfer position David Lewis responded to Elga's paper with the position that Sleeping Beauty's credence that the coin landed heads should be 1/2. Sleeping Beauty receives no new non-self-locating information throughout the experiment because she is told the details of the experiment. Since her credence before the experiment is P(Heads) = 1/2, she ought to continue to have a credence of P(Heads) = 1/2 since she gains no new relevant evidence when she wakes up during the experiment. This directly contradicts one of the thirder's premises, since it means P(Tails|Monday) = 1/3 and P(Heads|Monday) = 2/3. Philosophers such as Christopher Hitchcock have argued against the halfer position by arguing that Sleeping Beauty is subject to Dutch books if she assigns a credence of 1/2. It has been argued that halfers can avoid Dutch books by adopting evidential decision theory. However, Vincent Conitzer argues that halfers are still affected by Dutch books even after adopting evidential decision theory.

Double halfer position The double halfer position argues that both P(Heads) and P(Heads|Monday) equal 1/2. Mikaël Cozic, in particular, argues that context-sensitive propositions like "it is Monday" are in general problematic for conditionalization and proposes the use of an imaging rule instead, which supports the double halfer position.

… excerpt ends here. Continue reading the full article.

Illustrations

Sleeping Beauty problem: Illustration of the original sleeping beauty problem
Illustration of the original sleeping beauty problem

Worked examples

Example 1 — a first encounter with Sleeping Beauty problem

Start with the simplest possible case. Write down what Sleeping Beauty problem claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Sleeping Beauty problem before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Sleeping Beauty problem ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Sleeping Beauty problem

In research
Sleeping Beauty problem appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Sleeping Beauty problem in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Sleeping Beauty problem is common in secondary-school and first-year university syllabi. It links to neighbouring topics Epistemology, Probability problems, Probability theory paradoxes, so understanding it makes those chapters shorter.
In everyday life
Look for Sleeping Beauty problem outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Sleeping Beauty problem” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Sleeping Beauty problem in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Sleeping Beauty problem means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Sleeping Beauty problem out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Sleeping Beauty problem in simple terms?

The Sleeping Beauty problem, also known as the Sleeping Beauty paradox, is a puzzle in decision theory in which an ideally rational epistemic agent is told she will be awoken from sleep either once or twice according to the toss of a coin. Each time she will have no memory of whether she has been a…

Why does Sleeping Beauty problem matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Sleeping Beauty problem?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Sleeping Beauty problem.

Tags

  • Epistemology
  • Probability problems
  • Probability theory paradoxes
  • Puzzles

Keep exploring