The malicious host: a minimax solution of the Monty Hall problem

Jan C. Schuller

Journal of Applied Statistics, 2012, vol. 39, issue 1, 215-221

Abstract: 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.

Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1080/02664763.2011.580337 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:japsta:v:39:y:2012:i:1:p:215-221

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/CJAS20

DOI: 10.1080/02664763.2011.580337

Access Statistics for this article

Journal of Applied Statistics is currently edited by Robert Aykroyd

More articles in Journal of Applied Statistics from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().