1 / 14

Chapter 4 Introduction to Probability

Chapter 4 Introduction to Probability. I. Experiments, sample space and counting rules. Probability is the numerical measure of a chance or likelihood that a particular event will occur. 0 .5 1.0 Increasing likelihood. A. Definitions.

brockman
Download Presentation

Chapter 4 Introduction to Probability

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 4Introduction to Probability

  2. I. Experiments, sample space and counting rules Probability is the numerical measure of a chance or likelihood that a particular event will occur. 0 .5 1.0 Increasing likelihood.

  3. A. Definitions • Experiment: any process which generates well-defined outcomes. • “Well-defined” means that on any repetition of the experiment, one and only one outcome can occur. • Sample space is the set of all experimental outcomes. {S} • Sample point is any one particular experimental outcome.

  4. Examples of Experiments The sample space for the experiment “roll a die” is {S}={1,2,3,4,5,6}

  5. B. Counting Rules How can you figure the probability of an outcome if you don’t know how many outcomes exist?

  6. An example • The experiment is to sequentially toss 2 coins. 4 possible outcomes. H,H H,T H H T T,H T,T H T T

  7. Sequential counting rule The sequential counting rule: If an experiment has k steps in which there are n1 possible outcomes on the 1st step, n2 possible outcomes on the 2nd step, etc. then the total number of possible outcomes is = (n1)(n2)...(nk). Use the previous example to prove that this works!

  8. Combination Counting Rule. This is used to count the possible outcomes of an experiment when n objects are selected from a set of N objects. Note: n! is referred to as “n factorial”. If n=3, n!=3*2*1=6

  9. Example Suppose there is a 4-firm cartel. To successfully cheat on the cartel, a minimum of 2 firms must break away and secretly meet. How many possible combinations of these 4 firms can be made if 2 are being selected at a time? N=4, n=2

  10. II. Assigning Probabilities to Experimental Outcomes. Once you know how many outcomes exist, it is necessary to assign probabilities to each outcome.

  11. A. Necessary Conditions There are various approaches to assigning probabilities, but two basic requirements must be satisfied. 1. 0P(Ei)1 i, where Ei is the experimental outcome and P(Ei) is the probability of that outcome. 2. If all outcomes are considered, the sum of their probabilities must equal 1.

  12. B. Classical Assignment • Relies on the assumption of equally likely outcomes. • So with n possible outcomes, each P(Ei)=(1/n) Prove to yourself that assigning probabilities to the rolling of a 6-sided die subscribes to the necessary conditions.

  13. C. Relative Frequency Assumes unequal likelihood to each outcome and the probability is based on past behavior or known ratios. Example: In testing the market for a new product you contact 400 customers. 300 didn’t like it and would not buy it, 100 did like it and would buy it again. What’s the probability that a randomly chosen consumer would buy the product? P(Ebuy)=100/400=.25 Obviously the probability that a given consumer won’t buy is 1-.25=.75

  14. D. Subjective The outcomes are not equally likely, but no relative frequency data are available. You need to make a subjective estimate of P(Ei). Examples are setting odds on sporting events.

More Related