Research Article

Different Versions of the Monty Hall Problem

by  Mazen Alrahili
journal cover
International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 11 - Issue 9
Published: Jan 2017
Authors: Mazen Alrahili
10.5120/ijais2017451642
PDF

Mazen Alrahili . Different Versions of the Monty Hall Problem. International Journal of Applied Information Systems. 11, 9 (Jan 2017), 12-17. DOI=10.5120/ijais2017451642

                        @article{ 10.5120/ijais2017451642,
                        author  = { Mazen Alrahili },
                        title   = { Different Versions of the Monty Hall Problem },
                        journal = { International Journal of Applied Information Systems },
                        year    = { 2017 },
                        volume  = { 11 },
                        number  = { 9 },
                        pages   = { 12-17 },
                        doi     = { 10.5120/ijais2017451642 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2017
                        %A Mazen Alrahili
                        %T Different Versions of the Monty Hall Problem%T 
                        %J International Journal of Applied Information Systems
                        %V 11
                        %N 9
                        %P 12-17
                        %R 10.5120/ijais2017451642
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

The Monty Hall problem is a conditional probability example in which one of three doors has a big prize and other two doors conceive worthlessly. The game features are a rational decision between stay or switch given the constraints of the game. This paper aims to explain the different versions of the Monty Hall Problem in a many way to approve and solve the Monty Hall problem.

References
  • Bowman, M., Debray, S. K., and Peterson, L. L. 1993. Reasoning about naming systems.
  • Ding, W., and Marchionini, G. 1997 A Study on Video Browsing Strategies. Technical Report. The University of Maryland at College Park.
  • Fröhlich, B., and Plate, J. 2000. The cubic mouse: a new device for three-dimensional input. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
  • Tavel, P. 2007 Modeling, and Simulation Design. AK Peters Ltd.
  • Sannella, M. J. 1994 Constraint Satisfaction and Debugging for Interactive User Interfaces. Doctoral Thesis. UMI Order Number: UMI Order No. GAX95-09398., The University of Washington.
  • Forman, G. 2003. An extensive empirical study of feature selection metrics for text classification. J. Mach. Learn. Res. 3 (Mar. 2003), 1289-1305.
  • Brown, L. D., Hua, H., and Gao, C. 2003. A widget framework for augmented interaction in SCAPE.
  • Y.T. Yu, M.F. Lau, "A comparison of MC/DC, MUMCUT and several other coverage criteria for logical decisions," Journal of Systems and Software, 2005, in press.
  • Spector, A. Z. 1989. Achieving application requirements. In Distributed Systems, S. Mullender.
  • Rosenhouse, J. (2009) The Monty Hall Problem. Oxford University Press, New York.
  • Mazen Alrahili. Simulation of the Monty Hall Problem. International Journal of Computer Applications 152(6):16-19, October 2016.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Monty Hall Problem

Powered by PhDFocusTM