Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 

Saved Queries

Sign in to use this feature.

Search Filter Reset All

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
Add Subjects Reset
Select Subjects

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
Add Journals Reset
Select Journals

Article Types

remove_circle_outline
Add Article Types Reset
Select Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
Add Countries / Regions Reset
Select Countries / Regions
Update Search
share announcement

Search Results (3)

Search Parameters:
Keywords = Monty Hall game

Order results
Result details
Results per page
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
17 pages, 1902 KiB  
Article
Sleeping Beauty on Monty Hall
by Michel Janssen and Sergio Pernice
Philosophies 2020, 5(3), 15; https://doi.org/10.3390/philosophies5030015 - 13 Aug 2020
Cited by 1 | Viewed by 3158
Abstract
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 [...] Read more.
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 efficacy 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 first encounter it, the application of this strategy to this conundrum, we believe, is pedagogically useful. Full article
►▼ Show Figures

Figure 1

10 pages, 303 KiB  
Article
Quantum PBR Theorem as a Monty Hall Game
by Del Rajan and Matt Visser
Quantum Rep. 2020, 2(1), 39-48; https://doi.org/10.3390/quantum2010003 - 31 Dec 2019
Cited by 6 | Viewed by 3728
Abstract
The quantum Pusey–Barrett–Rudolph (PBR) theorem addresses the question of whether the quantum state corresponds to a ψ-ontic model (system’s physical state) or to a ψ-epistemic model (observer’s knowledge about the system). We reformulate the PBR theorem as a Monty Hall game [...] Read more.
The quantum Pusey–Barrett–Rudolph (PBR) theorem addresses the question of whether the quantum state corresponds to a ψ-ontic model (system’s physical state) or to a ψ-epistemic model (observer’s knowledge about the system). We reformulate the PBR theorem as a Monty Hall game and show that winning probabilities, for switching doors in the game, depend on whether it is a ψ-ontic or ψ-epistemic game. For certain cases of the latter, switching doors provides no advantage. We also apply the concepts involved in quantum teleportation, in particular for improving reliability. Full article
►▼ Show Figures

Graphical abstract

21 pages, 417 KiB  
Article
The Monty Hall Problem as a Bayesian Game
by Mark Whitmeyer
Games 2017, 8(3), 31; https://doi.org/10.3390/g8030031 - 26 Jul 2017
Cited by 3 | Viewed by 10235
Abstract
This paper formulates the classic Monty Hall problem as a Bayesian game. Allowing Monty a small amount of freedom in his decisions facilitates a variety of solutions. The solution concept used is the Bayes Nash Equilibrium (BNE), and the set of BNE relies [...] Read more.
This paper formulates the classic Monty Hall problem as a Bayesian game. Allowing Monty a small amount of freedom in his decisions facilitates a variety of solutions. The solution concept used is the Bayes Nash Equilibrium (BNE), and the set of BNE relies on Monty’s motives and incentives. We endow Monty and the contestant with common prior probabilities (p) about the motives of Monty and show that, under certain conditions on p, the unique equilibrium is one in which the contestant is indifferent between switching and not switching. This coincides and agrees with the typical responses and explanations by experimental subjects. In particular, we show that our formulation can explain the experimental results in Page (1998), that more people gradually choose switch as the number of doors in the problem increases. Full article
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying article 1-50 on page 1 of 1.
Back to TopTop