This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Steven Weber Dept. of ECE Drexel University ENGR 361: Statistical Analysis of Engineering Systems (Spring, 2010) Recitation 3 Solutions Question 1 Recall the Monty Hall example from lecture. Please consider the following variants of the problem and compute the probabilities of winning by sticking and switching. Do any three of the four problems. 1. Suppose Monty does not now know the location of the car. After your initial choice, Monty opens one of the two remaining doors, selected at random. If his selected door reveals the car then you lose. If his selected door reveals a goat, then you get the option to stick with your original door or to switch to the remaining door. Define events: • WS: win by switching • IC: initial door is correct • MC: Monty reveals the car Then the probability that you win by switching given that the initial choice is incorrect is: P ( WS | ¯ IC ) = P ( WS | ¯ IC,MC ) P ( MC | ¯ IC ) + P ( WS | ¯ IC, ¯ MC ) P ( ¯ MC | ¯ IC ) = 0 × 1 2 + 1 × 1 2...
View Full Document
This note was uploaded on 06/10/2010 for the course ENGR 361 taught by Professor Eisenstein during the Spring '04 term at Drexel.
- Spring '04