English
Related papers

Related papers: The Sleeping Beauty Problem: Sleeping Kelly is a T…

200 papers

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…

History and Overview · Mathematics 2024-03-26 Paulo S. Piva , Gabriel Ruffolo

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…

Physics and Society · Physics 2023-12-14 Hutan Ashrafian

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…

Other Statistics · Statistics 2017-05-19 Vincent Conitzer

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…

Probability · Mathematics 2024-08-14 Laurens Walleghem

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…

Quantum Physics · Physics 2026-03-05 Jiaxuan Zhang

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…

Artificial Intelligence · Computer Science 2008-06-10 Berry Groisman

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…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern

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…

Other Statistics · Statistics 2017-05-11 Vincent Conitzer

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…

Other Statistics · Statistics 2014-09-15 Ioannis Mariolis

How should we update de dicto beliefs in the face of de se evidence? The Sleeping Beauty problem divides philosophers into two camps, halfers and thirders. But there is some disagreement among halfers about how their position should…

Other Statistics · Statistics 2016-10-19 Vincent Conitzer

The focal point of this paper is the so-called Kelly Criterion, a prescription for optimal resource allocation among a set of gambles which are repeated over time. The criterion calls for maximization of the expected value of the…

Optimization and Control · Mathematics 2017-10-06 Chung-Han Hsieh , B. Ross Barmish

In this paper, we consider a simple discrete-time optimal betting problem using the celebrated Kelly criterion, which calls for maximization of the expected logarithmic growth of wealth. While the classical Kelly betting problem can be…

Optimization and Control · Mathematics 2021-03-11 Chung-Han Hsieh

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…

Data Analysis, Statistics and Probability · Physics 2017-09-21 Stuart Armstrong

We study single-player extensive-form games with imperfect recall, such as the Sleeping Beauty problem or the Absentminded Driver game. For such games, two natural equilibrium concepts have been proposed as alternative solution concepts to…

Computer Science and Game Theory · Computer Science 2023-05-30 Emanuel Tewolde , Caspar Oesterheld , Vincent Conitzer , Paul W. Goldberg

For a sequence of binary bets, the Kelly criterion provides a closed-form solution that maximizes the expected growth rate of wealth. In contrast, when multiple bets are placed simultaneously (e.g., in portfolio allocation or prediction…

Mathematical Finance · Quantitative Finance 2026-04-30 Ruslan Tepelyan , Daniel Lam

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,…

Probability · Mathematics 2025-09-04 Martin T. Barlow

We consider games of chance played by someone with external capital that cannot be applied to the game and determine how this affects risk-adjusted optimal betting. Specifically, we focus on Kelly optimization as a metric, optimizing the…

Portfolio Management · Quantitative Finance 2020-12-29 Stanislav Shalunov , Alexei Kitaev , Yakov Shalunov , Arseniy Akopyan

The main purpose of this study is to introduce a semi-classical model describing betting scenarios in which, at variance with conventional approaches, the payoff of the gambler is encoded into the internal degrees of freedom of a quantum…

Quantum Physics · Physics 2021-09-22 Salvatore Tirone , Maddalena Ghio , Giulia Livieri , Vittorio Giovannetti , Stefano Marmi

Kelly betting is a prescription for optimal resource allocation among a set of gambles which are typically repeated in an independent and identically distributed manner. In this setting, there is a large body of literature which includes…

Portfolio Management · Quantitative Finance 2017-10-06 Chung-Han Hsieh , B. Ross Barmish , John A. Gubner

This paper presents an efficient algorithm to solve the sleeping bandit with multiple plays problem in the context of an online recommendation system. The problem involves bounded, adversarial loss and unknown i.i.d. distributions for arm…

Machine Learning · Computer Science 2023-07-28 Jianjun Yuan , Wei Lee Woon , Ludovik Coba
‹ Prev 1 2 3 10 Next ›