Revisiting the Sleeping Beauty problem

Paulo S. Piva, Gabriel Ruffolo
3/25/2024
math.HOcs.AI

No confident code implementation found for this paper.

Abstract

The Sleeping Beauty problem is a probability riddle with no definite solution for more than two decades and its solution is of great interest in many fields of knowledge. There are two main competing solutions to the problem: the halfer approach, and the thirder approach. The main reason for disagreement in the literature is connected to the use of different probability spaces to represent the same probabilistic riddle. In this work, we analyse the problem from a mathematical perspective, identifying probability distributions induced directly from the thought experiment's rules. The precise choices of probability spaces provide both halfer and thirder solutions to the problem. To try and decide on which approach to follow, a criterion involving the information available to Sleeping Beauty is proposed.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{piva2024revisiting,
  title  = {Revisiting the Sleeping Beauty problem},
  author = {Paulo S. Piva and Gabriel Ruffolo},
  year   = {2024},
  eprint = {2403.16666},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.16666v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.16666.svg)](https://codeofpaper.com/paper/2403.16666)

Discussion