What's So Hard about the Monty Hall Problem?
Rafael C. Alvarado

TL;DR
The paper explores the historical and conceptual challenges of understanding the Monty Hall problem, emphasizing the importance of dependency structures and Bayesian reasoning in grasping its counter-intuitive solution.
Contribution
It provides a historical background, explains the difficulty in understanding the problem, and demonstrates a Bayesian solution with a probabilistic graphical model to clarify dependencies.
Findings
Bayesian approach yields correct solution
Dependency structures are key to understanding
Graphical models clarify the problem's counter-intuitiveness
Abstract
The Monty Hall problem is notorious for its deceptive simplicity. Although today it is widely used as a provocative thought experiment to introduce Bayesian thinking to students of probability, in the not so distant past it was rejected by established mathematicians. This essay provides some historical background to the problem and explains why it is considered so counter-intuitive to many. It is argued that the main barrier to understanding the problem is the back-grounding of the concept of dependence in probability theory as it is commonly taught. To demonstrate this, a Bayesian solution is provided and augmented with a probabilistic graphical model (PGM) inspired by the work of Pearl (1988, 1998). Although the Bayesian approach produces the correct answer, without a representation of the dependency structure of events implied by the problem, the salient fact that motivates the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms
