1 Learning Objectives Bayes’ Formula The student will be able to solve problems involving finding the probability of an earlier event conditioned on the.

Slides:



Advertisements
Similar presentations
The Monty Hall Problem Madeleine Jetter 6/1/2000.
Advertisements

ABC Welcome to the Monty Hall show! Behind one of these doors is a shiny new car. Behind two of these doors are goats Our contestant will select a door.
Probability and Statistics
Probability Activities Tree Diagrams, Sequences, Summation Notation, Dice Rolling, Rock-Paper- Scissors, and The “Monty Hall” Problem.
Probability Monty Hall, Bayes Law, and why Anya probably isn’t autistic Arup Guha 1/14/2013.
COUNTING AND PROBABILITY
Bayes’ Rule: The Monty Hall Problem Josh Katzenstein Kerry Braxton-Andrew Problem From: Image from:
Discrete Mathematics. When we toss two coins, the number of heads that turns up can be 0, 1, or 2. What is the chance you will get 1?
1 1 PRESENTED BY E. G. GASCON Introduction to Probability Section 7.3, 7.4, 7.5.
Learning Objectives for Section 8.1 Probability
Section 1 Sample Spaces, Events, and Probability
Section 16.1: Basic Principles of Probability
1 Probability Part 1 – Definitions * Event * Probability * Union * Intersection * Complement Part 2 – Rules Part 1 – Definitions * Event * Probability.
Lec 18 Nov 12 Probability – definitions and simulation.
Unit 6: Probability. Expected values Ex 1: Flip a coin 10 times, paying $1 to play each time. You win $.50 (plus your $1) if you get a head. How much.
Games, Logic, and Math Kristy and Dan. GAMES Game Theory Applies to social science Applies to social science Explains how people make all sorts of decisions.
Statistics Lecture 6. Last day: Probability rules Today: Conditional probability Suggested problems: Chapter 2: 45, 47, 59, 63, 65.
1 Many people debate basic questions of chance in games such as lotteries. The Monty Hall problem is a fun brain teaser that Marilyn vos Savant addressed.
1 Econ 240A Power Three. 2 Summary: Week One Descriptive Statistics –measures of central tendency –measures of dispersion Distributions of observation.
1 Section 5.1 Discrete Probability. 2 LaPlace’s definition of probability Number of successful outcomes divided by the number of possible outcomes This.
1 Econ 240A Power Three. 2 Summary: Week One Descriptive Statistics –measures of central tendency –measures of dispersion Exploratory data Analysis –stem.
Learning Goal 13: Probability Use the basic laws of probability by finding the probabilities of mutually exclusive events. Find the probabilities of dependent.
Math Fun with Card Tricks, TV Game Shows and M&Ms
Statistics and Data Analysis Professor William Greene Stern School of Business IOMS Department Department of Economics.
What is the probability that it will snow on Christmas day in Huntingdon?
Probability, Bayes’ Theorem and the Monty Hall Problem
COMP14112: Artificial Intelligence Fundamentals L ecture 3 - Foundations of Probabilistic Reasoning Lecturer: Xiao-Jun Zeng
Chapter 3 Probability.
5.1 Basic Probability Ideas
Independence and Dependence 1 Krishna.V.Palem Kenneth and Audrey Kennedy Professor of Computing Department of Computer Science, Rice University.
Conditional Probability and Independence If A and B are events in sample space S and P(B) > 0, then the conditional probability of A given B is denoted.
1 Introduction to Discrete Probability Rosen, Section 6.1 Based on slides by Aaron Bloomfield and …
Objective Probabilities
Chapter 8 Probability Section R Review. 2 Barnett/Ziegler/Byleen Finite Mathematics 12e Review for Chapter 8 Important Terms, Symbols, Concepts  8.1.
Section 7.1. Section Summary Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning.
The Practice of Statistics, 5th Edition Starnes, Tabor, Yates, Moore Bedford Freeman Worth Publishers CHAPTER 5 Probability: What Are the Chances? 5.2.
Chapter 7 With Question/Answer Animations. Section 7.1.
Week 9 - Wednesday.  What did we talk about last time?  Exam 2  Before that: review  Before that: relations.
Topic 2: Intro to probability CEE 11 Spring 2002 Dr. Amelia Regan These notes draw liberally from the class text, Probability and Statistics for Engineering.
MATH CHALLENGE Challenge your mind!  Math is all around you in …  Nature  Art  Games  The following slides have links and puzzles for you.  Select.
Mathematics Conditional Probability Science and Mathematics Education Research Group Supported by UBC Teaching and Learning Enhancement Fund
Monty Hall problem. Joint probability distribution  In the study of probability, given two random variables X and Y, the joint distribution of X and.
Making sense of randomness
Expectations, Permutations & Combinations 1 Krishna.V.Palem Kenneth and Audrey Kennedy Professor of Computing Department of Computer Science, Rice University.
Natural Language Processing Giuseppe Attardi Introduction to Probability IP notice: some slides from: Dan Jurafsky, Jim Martin, Sandiway Fong, Dan Klein.
Introduction Lecture 25 Section 6.1 Wed, Mar 22, 2006.
Independence and Dependence 1 Krishna.V.Palem Kenneth and Audrey Kennedy Professor of Computing Department of Computer Science, Rice University.
+ Chapter 5 Overview 5.1 Introducing Probability 5.2 Combining Events 5.3 Conditional Probability 5.4 Counting Methods 1.
Section 7.1. Probability of an Event We first define these key terms: An experiment is a procedure that yields one of a given set of possible outcomes.
Microsoft produces a New operating system on a disk. There is 0
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 8.4 Bayes’ Formula The student will be able to solve problems involving.
7.4 Baye’s Formula In this section, we will find the probability of an earlier event conditioned on the occurrence of a later event.
Chapter 8 Probability Section 1 Sample Spaces, Events, and Probability.
Reviews of probability Question 1: Suppose we have a “ABCDE” litters how many words we can compose from them with 4 litters without repetition.
11.3 and 11.4: Probability Rules. Key Vocabulary  Independent events: The outcome of one event does not affect the outcome of another  Dependent events:
Ray Karol 2/26/2013. Let’s Make a Deal Monte Hall Problem Suppose you’re on a game show, and you’re given a choice of three doors: Behind one door is.
Ch 11.7 Probability. Definitions Experiment – any happening for which the result is uncertain Experiment – any happening for which the result is uncertain.
The Practice of Statistics, 5th Edition Starnes, Tabor, Yates, Moore Bedford Freeman Worth Publishers CHAPTER 5 Probability: What Are the Chances? 5.2.
1 COMP2121 Discrete Mathematics Principle of Inclusion and Exclusion Probability Hubert Chan (Chapters 7.4, 7.5, 6) [O1 Abstract Concepts] [O3 Basic Analysis.
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
Probability Distributions. Conditional Probability
The Monty Hall Problem Madeleine Jetter 6/1/2000.
Natural Language Processing
Discrete Probability Chapter 7 With Question/Answer Animations
Discrete Math for CS CMPSC 360 LECTURE 32 Last time: Review. Today:
Introduction to Probability
A Problem that will delight your fancy
Lecture 2: Probability.
Probability Rules.
Presentation transcript:

1 Learning Objectives Bayes’ Formula The student will be able to solve problems involving finding the probability of an earlier event conditioned on the occurrence of a later event using Bayes’ Formula. The student will be able to solve problems of the above type using a probability tree.

2 Probability of an Earlier Event Given a Later Event A survey of middle-aged men reveals that 28% of them are balding at the crown of their head. Moreover, it is known that such men have an 18% probability of suffering a heart attack in the next 10 years. Men who are not balding in this way have an 11% probability of a heart attack. If a middle-aged man is randomly chosen, what is the probability that he is balding, given that he suffered a heart attack? See tree diagram on next slide.

3 Tree Diagram We want P(B|H) = probability that he is balding, given that he suffered a heart attack. Balding 0.28 Not balding 0.72 heart attack 0.18 heart attack 0.11 no heart attack 0.82 no heart attack 0.89

4 Derivation of Bayes’ Formula

5 Solution of Problem = 0.389

6 Another Method of Solution Balding 0.28 Not balding 0.72 heart attack 0.18 heart attack 0.11 no heart attack 0.82 no heart attack 0.89 (0.28)(0.18) = (0.72)(0.11) = Another way to look at this problem is that we know the person had a heart attack, so he has followed one of the two red paths. The sample space has been reduced to these paths. So the probability that he is balding is which is /( ) = 0.389

7 Summary of Tree Method of Solution You do not need to memorize Bayes’ formula. In practice, it is usually easier to draw a probability tree and use the following: Let U 1, U 2,…U n be n mutually exclusive events whose union is the sample space S. Let E be an arbitrary event in S such that P(E)  0. Then product of branch probabilities leading to E through U 1 P(U 1 |E) = sum of all branch products leading to E Similar results hold for U 2, U 3,…U n

Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1 [but the door is not opened], and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice? A well-known statement of the problem was published in Marilyn vos Savant's "Ask Marilyn" column in Parade magazine in 1990 (vos Savant 1990):Marilyn vos SavantParadevos Savant 1990 Vos Savant's response was that the contestant should always switch to the other door. If the car is initially equally likely to be behind each door, a player who picks Door 1 and doesn't switch has a 1 in 3 chance of winning the car while a player who picks Door 1 and does switch has a 2 in 3 chance. The host has removed an incorrect option from the unchosen doors, so contestants who switch double their chances of winning the car. Many readers refused to believe that switching is beneficial. After the Monty Hall problem appeared in Parade, approximately 10,000 readers, including nearly 1,000 with PhDs, wrote to the magazine claiming that vos Savant was wrong. (Tierney 1991) Even when given explanations, simulations, and formal mathematical proofs, many people still do not accept that switching is the best strategy.PhDsTierney 1991

Vos Savant's solution The solution presented by vos Savant in Parade (vos Savant 1990b) shows the three possible arrangements of one car and two goats behind three doors and the result of switching or staying after initially picking Door 1 in each case:vos Savant 1990b A player who stays with the initial choice wins in only one out of three of these equally likely possibilities, while a player who switches wins in two out of three. The probability of winning by staying with the initial choice is therefore 1/3, while the probability of winning by switching is 2/3.

Car is behind door # P(C=c)Player selects door # P(S=s)Host opens door # P(H=h)P(branch)Stay W=car L=goat Total P(W) SwitchTotal P(W) C=11/3 S=11/3 H=21/21/18W 1/18+ 1/18+ 1/18+ 1/18+ 1/18+ 1/18= 6/18 L 1/9+ 1/9+ 1/9+ 1/9+ 1/9+ 1/9= 6/9 H=31//21/18WL S=21/3H=311/9LW S=31/3H=211/9LW C=21/3 S=11/3H=311/9LW S=21/3 H=11/21/18WL H=31//21/18WL S=31//3H=111/9LW C=31/3 S=11/3H=211/9LW S=21/3H=111/9LW S=31/3 H=11/21/18WL H=21/21/18WL

11