Skip to main content

A Bayesian Interpretation of the Monty Hall Problem with Epistemic Uncertainty

  • Conference paper
  • First Online:
Modeling Decisions for Artificial Intelligence (MDAI 2021)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 12898))

  • 533 Accesses

Abstract

The Monty Hall problem is a classic puzzle that, in addition to intriguing the general public, has stimulated research into the foundations of reasoning about uncertainty. A key insight to understanding the Monty Hall problem is to realize that the specification of the behavior of the host (i.e. Monty) of the game is fundamental. Here we go one step further and reason, in Bayesian way, in terms of epistemic uncertainty about the behavior of host, assuming subjective probabilities.

We also consider several generalizations of the classic Monty Hall problem considering different priors for the doors, several doors instead of three, and different ways the host can choose which door to open when several are possible. We show that in these generalized versions, the player faces a sequential decision problem, since the choice of the first door is key. We provide a general solution for the most general case using decision trees and determine the optimal policy.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    A possible extension of this work could investigate the use of Bayesian hierarchical models, adopting prior distributions on the mixture’s parameters.

  2. 2.

    Indeed the original statement of the MHP concerns the specific decision of what to do when offered the possibility of switching.

  3. 3.

    Rosenhouse [11] also addresses the case where the car is not placed behind the doors with equal probability, but assuming the fixed “always open” protocol for Monty.

  4. 4.

    In this generalized model, switching occurs when the choice at node F is a different door from the one chosen at the root S.

References

  1. Grünwald, P., Halpern, J.Y.: Updating probabilities. J. Artif. Intell. Res. 19, 243–278 (2003). https://doi.org/10.1613/jair.1164

  2. Halpern, J.Y.: Reasoning About Uncertainty. MIT Press, Cambridge (2005)

    Google Scholar 

  3. Jaeger, M.: On testing the missing at random assumption. In: Machine Learning: ECML 2006, 17th European Conference on Machine Learning, Berlin, Germany, 18–22 September 2006, Proceedings, pp. 671–678 (2006)

    Google Scholar 

  4. Jensen, F.V., Nielsen, T.D.: Bayesian Networks and Decision Graphs, 2nd edn. Springer, New York (2007). https://doi.org/10.1007/978-0-387-68282-2

    Book  MATH  Google Scholar 

  5. Kooi, B.P.: Probabilistic dynamic epistemic logic. J. Logic Lang. Inform. 12(4), 381–408 (2003)

    Article  MathSciNet  Google Scholar 

  6. Lucas, S.K., Rosenhouse, J.: Optimal strategies for the progressive Monty Hall problem. Math. Gaz. 93(528), 410–419 (2009). https://doi.org/10.1017/S0025557200185158

    Article  Google Scholar 

  7. Lucas, S.K., Rosenhouse, J., Schepler, A.: The Monty Hall problem, reconsidered. Math. Mag. 82(5), 332–342 (2009). http://www.jstor.org/stable/27765931

  8. MacKay, D.J.C.: Information Theory, Inference, and Learning Algorithms. Cambridge University Press, New York (2003)

    Google Scholar 

  9. Marlin, B.M., Zemel, R.S.: Collaborative prediction and ranking with non-random missing data. In: Proceedings of the 2009 ACM Conference on Recommender Systems, RecSys 2009, New York, NY, USA, 23–25 October 2009, pp. 5–12. ACM (2009)

    Google Scholar 

  10. Mueser, P., Granberg, D., Mueser, K., Nickerson, R.: The Monty Hall dilemma revisited: Understanding the interaction of problem definition and decision making. University of Missouri Working Paper, February 1999

    Google Scholar 

  11. Rosenhouse, J.: The Monty Hall Problem: The Remarkable Story of Math’s Most Contentious Brainteaser. Oxford University Press, Oxford (2009)

    Google Scholar 

  12. vos Savant, M.: Ask Marilyn. Parade, p. 15, September 1990

    Google Scholar 

  13. vos Savant, M.: Ask Marilyn. Parade, p. 25, December 1990

    Google Scholar 

  14. Selvin, S., et al.: Letters to the editor. Am. Stat. 29(1), 67–71 (1975). http://www.jstor.org/stable/2683689

  15. Stibel, J., Dror, I., Ben-Zeev, A.: The collapsing choice theory: Dissociating choice and judgment in decision making. Theory Decision 66, 149–179 (2009). https://doi.org/10.1007/s11238-007-9094-7

  16. Viappiani, P., Boutilier, C.: On the equivalence of optimal recommendation sets and myopically optimal query sets. Artif. Intell. J. 286, 103328 (2020)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Paolo Viappiani .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Manfredotti, C., Viappiani, P. (2021). A Bayesian Interpretation of the Monty Hall Problem with Epistemic Uncertainty. In: Torra, V., Narukawa, Y. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2021. Lecture Notes in Computer Science(), vol 12898. Springer, Cham. https://doi.org/10.1007/978-3-030-85529-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-85529-1_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-85528-4

  • Online ISBN: 978-3-030-85529-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics