[Previous][Next]
[Index]
Monty Haul Problem
- To: <csail-discuss@>
- Subject: Monty Haul Problem
- From: "Michael McGeachie" <mmcgeach@>
- Date: Fri, 16 Apr 2004 14:49:02 -0400
Friends, Stataites, Labmembers.
I come to you with a problem. An economist friend of mine thinks that even
seasoned statistical reasoners have difficulty solving the following
problem, or if they can, then they have difficulty explaining it. This is a
modified version of the Monty Haul problem:
Modified Monty:
Monty presents you with three identical boxes, one of which contains a prize
and two of which are empty. You first choose one box, but do not open it.
Monty then opens one of the remaining unchosen boxes, and shows you that it
is empty. Since there are two empty boxes, Monty can always do this. Monty
then gives you a choice: you may open the box you have already chosen, or
trade with Monty for the remaining unopened box, and open that one. What
then, is the best strategy, and what is the probability of winning the
prize?
And in a modified spirit of the CSAIL-Discuss mailing list, the three or
four of you who have yet to unsubscribe are invited to respond (not to the
whole list, please) with answers and explanations, the best of which earns a
free beverage at this evening's 3rd Stata Centered...
+- -+
girl scout benefit -+- 5:30 pm -+- 32-G9 lounge
+- -+
For those coming from elsewhere: Building 32 is
<http://whereis.mit.edu/map-jpg?selection=32>
Once you are in 32, just take the G-elevator to the 9th
floor and we will be in the lounge that you will be looking at
[Previous][Next]
[Index]
Brought to you by the few, the proud, the owners of the closest shorn
yaks, the den-mothers at csail
Last updated: Fri Feb 22 19:38:53 2008