The Monty Hall Problem in the Game Theory Class
classification
🧮 math.HO
cs.GT
keywords
gamehallmontyproblemtheoryactionanalysisarguments
read the original abstract
The basic Monty Hall problem is explored to introduce into the fundamental concepts of the game theory and to give a complete Bayesian and a (noncooperative) game-theoretic analysis of the situation. Simple combinatorial arguments are used to exclude the holding action and to find minimax solutions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.