The malicious host: a minimax solution of the Monty Hall problem
The classic solution of the Monty Hall problem tacitly assumes that, after the candidate made his/her first choice, the host always allows the candidate to switch doors after he/she showed to the candidate a losing door, not initially chosen by the candidate. In view of actual TV shows, it seems a more credible assumption that the host will or will not allow switching. Under this assumption, possible strategies for the candidate are discussed, with respect to a minimax solution of the problem. In conclusion, the classic solution does not necessarily provide a good guidance for a candidate on a game show. It is discussed that the popularity of the problem is due to its incompleteness.
Volume (Year): 39 (2012)
Issue (Month): 1 (April)
|Contact details of provider:|| Web page: http://www.tandfonline.com/CJAS20|
|Order Information:||Web: http://www.tandfonline.com/pricing/journal/CJAS20|
When requesting a correction, please mention this item's handle: RePEc:taf:japsta:v:39:y:2012:i:1:p:215-221. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Michael McNulty)
If references are entirely missing, you can add them using this form.