How the Monty Hall problem is similar to the false discovery rate in high-throughput data analysis.
How the Monty Hall problem is similar to the false discovery rate in high-throughput data analysis.
复制标题
Monty Hall 问题与高通量数据分析中的错误发现率有何相似之处。
DOI:
10.1038/s41587-023-01794-9
复制
发表时间:
2023
影响因子:
46.9
通讯作者:
Li,JingyiJessica
中科院分区:
文献类型:
--
作者:
Li,JingyiJessica
Let’s Make a Deal. The game has three doors, with a car behind one door and a goat behind each of the other two doors. The contestant does not know which door the car is behind and thus randomly chooses a door. This is where the situation becomes interesting. The host, who can see what is behind the two unchosen doors, opens one unchosen door with a goat behind it and asks the contestant if they would like to switch their already chosen door with the unopened unchosen door. The question is: would switching increase the contestant’s chance of winning? The Monty Hall problem became famous as a brain teaser. An overwhelming majority of people’s first guess is that switching would not increase the chance of winning because it is impossible to be certain about which of the two unopened doors has the car behind it. However, the fact that the car can be behind either unopened door does not mean that the two unopened doors are equally likely to be hiding the car. What is the reason? The order of actions matters.