The Monty Hall Problem in the Game Theory Class
History and Overview
2011-07-05 v1 Computer Science and Game Theory
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.
Keywords
Cite
@article{arxiv.1107.0326,
title = {The Monty Hall Problem in the Game Theory Class},
author = {Alexander Gnedin},
journal= {arXiv preprint arXiv:1107.0326},
year = {2011}
}
Comments
18 pages, 1 color figure