Simulating the Monty Hall problem in a DNA sequencing machine

2019 ◽  
Vol 83 ◽  
pp. 107122
Author(s):  
Noam Mamet ◽  
Gil Harari ◽  
Adva Zamir ◽  
Ido Bachelet
2018 ◽  
Author(s):  
Noam Mamet ◽  
Gil Harari ◽  
Adva Zamir ◽  
Ido Bachelet

The Monty Hall problem is a decision problem with an answer that is surprisingly counter-intuitive yet provably correct. Here we simulate and prove this decision in a high- throughput DNA sequencing machine, using a simple encoding. All possible scenarios are represented by DNA oligonucleotides, and gameplay decisions are implemented by sequencing these oligonucleotides from specific positions, with a single run simulating more than 12,000,000 independent games. This work highlights high-throughput DNA sequencing as a new tool that could extend existing capabilities and enable new encoding schemes for problems in DNA computing.


2019 ◽  
Vol 33 (3) ◽  
pp. 144-162 ◽  
Author(s):  
Joshua B. Miller ◽  
Adam Sanjurjo

We show how classic conditional probability puzzles, such as the Monty Hall problem, are intimately related to the recently discovered hot hand selection bias. We explain the connection by way of the principle of restricted choice, an intuitive inferential rule from the card game bridge, which we show is naturally quantified as the updating factor in the odds form of Bayes’s rule. We illustrate how, just as the experimental subject fails to use available information to update correctly when choosing a door in the Monty Hall problem, researchers may neglect analogous information when designing experiments, analyzing data, and interpreting results.


Games ◽  
2017 ◽  
Vol 8 (3) ◽  
pp. 31
Author(s):  
Mark Whitmeyer

Sign in / Sign up

Export Citation Format

Share Document