CFP last date
15 January 2025
Call for Paper
February Edition
IJAIS solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 15 January 2025

Submit your paper
Know more
The week's pick
Responsive image
Ordered Frequent Itemsets Matrix Based On Fp-Tree Structure And Apriori Algorithm

Abdulkader M. Al-Badani Abdualmajed A. Al-Khulaidi
Random Articles
Reseach Article

Different Versions of the Monty Hall Problem

by Mazen Alrahili
journal cover thumbnail

International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 11 - Number 9
Year of Publication: 2017
Authors: Mazen Alrahili
10.5120/ijais2017451642

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 },
issue_date = { Jan 2017 },
volume = { 11 },
number = { 9 },
month = { Jan },
year = { 2017 },
issn = { 2249-0868 },
pages = { 12-17 },
numpages = {9},
url = { https://www.ijais.org/archives/volume11/number9/963-2017451642/ },
doi = { 10.5120/ijais2017451642 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-07-05T19:04:40.630767+05:30
%A Mazen Alrahili
%T Different Versions of the Monty Hall Problem
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 11
%N 9
%P 12-17
%D 2017
%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
  1. Bowman, M., Debray, S. K., and Peterson, L. L. 1993. Reasoning about naming systems.
  2. Ding, W., and Marchionini, G. 1997 A Study on Video Browsing Strategies. Technical Report. The University of Maryland at College Park.
  3. 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
  4. Tavel, P. 2007 Modeling, and Simulation Design. AK Peters Ltd.
  5. 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.
  6. Forman, G. 2003. An extensive empirical study of feature selection metrics for text classification. J. Mach. Learn. Res. 3 (Mar. 2003), 1289-1305.
  7. Brown, L. D., Hua, H., and Gao, C. 2003. A widget framework for augmented interaction in SCAPE.
  8. 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.
  9. Spector, A. Z. 1989. Achieving application requirements. In Distributed Systems, S. Mullender.
  10. Rosenhouse, J. (2009) The Monty Hall Problem. Oxford University Press, New York.
  11. 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

Keywords

Monty Hall Problem

Powered by PhDFocusTM