**Unformatted text preview: **and Tails with probability exactly 1 2 each), by looking at multiple ﬂips. Problem 4: Consider a variant of the “Monty Hall” game show discussed in class. There are k ≥ 3 doors, one of which has a grand prize behind it. You pick one of the k doors initially. The host opens one of the remaining doors to show that the prize is not there. You are now given the option of changing your initial choice. What should you do? Compute the probability of guessing the correct door for the strategy you propose....

View
Full Document

- Fall '07
- CharikarandChazelle
- Computer Science, Set Theory, Monty Hall, possible non-empty subsets