Related papers: Revisiting the Sleeping Beauty problem
The Sleeping Beauty Problem remains a paradoxical problem that penetrates multiple disciplines that include probability theory, self-locating belief, decision theory, cognitive science, the philosophy of mathematics and science. It asks the…
The Sleeping Beauty problem is a problem of imperfect recall that has received considerable attention. One approach to solving the Sleeping Beauty problem is to allow Sleeping Beauty to make decisions based on her beliefs, and then…
The Sleeping Beauty problem is a puzzle in probability theory that has gained much attention since Elga's discussion of it [Elga, Adam, Analysis 60 (2), p.143-147 (2000)]. Sleeping Beauty is put asleep, and a coin is tossed. If the outcome…
The Sleeping Beauty Problem (SBP) is a long-standing puzzle in classical probability theory and has been used to challenge the Many-Worlds Interpretation (MWI) of quantum mechanics, since both involve objective determinacy combined with…
A large number of essays address the Sleeping Beauty problem, which undermines the validity of Bayesian inference and Bas Van Fraassen's 'Reflection Principle'. In this study a straightforward analysis of the problem based on probability…
This paper presents a little reflection about the Sleeping Beauty Problem, maybe contributing to shed light on it and perhaps helping to find a simple and elegant solution that could definitively resolve the controversies about it.
The way a rational agent changes her belief in certain propositions/hypotheses in the light of new evidence lies at the heart of Bayesian inference. The basic natural assumption, as summarized in van Fraassen's Reflection Principle…
Significant controversy remains about what constitute correct self-locating beliefs in scenarios such as the Sleeping Beauty problem, with proponents on both the "halfer" and "thirder" sides. To attempt to settle the issue, one natural…
We consider models for inference which involve observers which may have multiple copies, such as in the Sleeping Beauty problem. We establish a framework for describing these problems on a probability space satisfying Kolmogorov's axioms,…
A careful analysis of conditioning in the Sleeping Beauty problem is done, using the formal model for reasoning about knowledge and probability developed by Halpern and Tuttle. While the Sleeping Beauty problem has been viewed as revealing…
Two works related to the concept of probability in the framework of the many-worlds interpretation are presented. The first deals with recent controversy in classical probability theory. Elga and D. Lewis argues that Sleeping Beauty should…
In the context of the Sleeping Beauty problem, it has been argued that so-called "halfers" can avoid Dutch book arguments by adopting evidential decision theory. I introduce a Dutch book for a variant of the Sleeping Beauty problem and…
This paper sets out to resolve how agents ought to act in the Sleeping Beauty problem and various related anthropic (self-locating belief) problems, not through the calculation of anthropic probabilities, but through finding the correct…
A sleeping beauty in diffusion indicates that the information, can be ideas or innovations, will experience a hibernation before a sudden spike of popularity and it is widely found in citation history of scientific publications. However, in…
A $p$-beauty contest is a wide class of games of guessing the most popular strategy among other players. In particular, guessing a fraction of a mean of numbers chosen by all players is a classic behavioral experiment designed to test…
A longstanding issue in attempts to understand the Everett (Many-Worlds) approach to quantum mechanics is the origin of the Born rule: why is the probability given by the square of the amplitude? Following Vaidman, we note that observers…
A Sleeping Beauty in Science is a publication that goes unnoticed (sleeps) for a long time and then, almost suddenly, attracts a lot of attention (is awakened by a prince). In this paper we investigate important properties of Sleeping…
We consider the two-sided stable matching setting in which there may be uncertainty about the agents' preferences due to limited information or communication. We consider three models of uncertainty: (1) lottery model --- in which for each…
The Stable Roommates problem involves matching a set of agents into pairs based on the agents' strict ordinal preference lists. The matching must be stable, meaning that no two agents strictly prefer each other to their assigned partners. A…
We survey the problem of deciding the stability or stabilizability of uncertain linear systems whose region of uncertainty is a polytope. This natural setting has applications in many fields of applied science, from Control Theory to…