Slides prepared by JOHN LOUCKS St. Edward’s University

55
1 © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University

description

Slides prepared by JOHN LOUCKS St. Edward’s University. Chapter 4 Decision Analysis. Problem Formulation Decision Making without Probabilities Decision Making with Probabilities Risk Analysis and Sensitivity Analysis Decision Analysis with Sample Information - PowerPoint PPT Presentation

Transcript of Slides prepared by JOHN LOUCKS St. Edward’s University

Page 1: Slides prepared by JOHN  LOUCKS St. Edward’s University

1 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Slidesprepared by

JOHN LOUCKS

St. Edward’sUniversity

Page 2: Slides prepared by JOHN  LOUCKS St. Edward’s University

2 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Chapter 4Decision Analysis

Problem Formulation Decision Making without Probabilities Decision Making with Probabilities Risk Analysis and Sensitivity Analysis Decision Analysis with Sample Information Computing Branch Probabilities

Page 3: Slides prepared by JOHN  LOUCKS St. Edward’s University

3 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Problem Formulation The first step in the decision analysis process

is problem formulation. We begin with a verbal statement of the

problem. Then we identify:• the decision alternatives• the states of nature (uncertain future

events)• the payoff (consequences) associated with

each specific combination of:• decision alternative• state of nature

Page 4: Slides prepared by JOHN  LOUCKS St. Edward’s University

4 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Burger Prince Restaurant is considering

opening a new restaurant on Main Street.

The company has three differentbuilding designs (A, B, and C), eachwith a different seating capacity.

Burger Prince estimates that theaverage number of customers

arrivingper hour will be 40, 60, or 80.

Example: Burger Prince Restaurant

Problem Formulation

Page 5: Slides prepared by JOHN  LOUCKS St. Edward’s University

5 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Problem Formulation

d1 = use building design Ad2 = use building design Bd3 = use building design C

Decision Alternatives

States of Natures1 = an average of 40 customers arriving per hour

s2 = an average of 60 customers arriving per hours3 = an average of 80 customers arriving per hour

Page 6: Slides prepared by JOHN  LOUCKS St. Edward’s University

6 Slide

© 2006 Thomson South-Western. All Rights Reserved.

The consequence resulting from a specific combination of a decision alternative and a state of nature is a payoff.

A table showing payoffs for all combinations of decision alternatives and states of nature is a payoff table.

Payoffs can be expressed in terms of profit, cost, time, distance or any other appropriate measure.

Problem Formulation Payoff

Table

Page 7: Slides prepared by JOHN  LOUCKS St. Edward’s University

7 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Payoff Table (Payoffs are Profit Per Week)

$ 6,000 $16,000 $21,000$ 8,000 $18,000 $12,000$10,000 $15,000 $14,000

Average Number of Customers Per

Hours1 = 40 s2 = 60 s3 = 80

Design ADesign BDesign C

Problem Formulation

Page 8: Slides prepared by JOHN  LOUCKS St. Edward’s University

8 Slide

© 2006 Thomson South-Western. All Rights Reserved.

An influence diagram is a graphical device showing the relationships among the decisions, the chance events, and the consequences.

Squares or rectangles depict decision nodes.

Circles or ovals depict chance nodes. Diamonds depict consequence nodes. Lines or arcs connecting the nodes show

the direction of influence.

Influence Diagram

Problem Formulation

Page 9: Slides prepared by JOHN  LOUCKS St. Edward’s University

9 Slide

© 2006 Thomson South-Western. All Rights Reserved.

RestaurantDesign Profit

AverageNumber ofCustomersPer Hour

Influence Diagram

Problem Formulation

Design A (d1)Design B (d2)Design C (d3)

DecisionAlternatives

40 customers per hour (s1)60 customers per hour (s2)80 customers per hour (s3)

States of Nature

ConsequenceProfit

Page 10: Slides prepared by JOHN  LOUCKS St. Edward’s University

10 Slide

© 2006 Thomson South-Western. All Rights Reserved.

A decision tree is a chronological representation of the decision problem.

A decision tree has two types of nodes:• round nodes correspond to chance

events• square nodes correspond to decisions

Branches leaving a round node represent the different states of nature; branches leaving a square node represent the different decision alternatives.

At the end of a limb of the tree is the payoff attained from the series of branches making up the limb.

Problem Formulation Decision

Tree

Page 11: Slides prepared by JOHN  LOUCKS St. Edward’s University

11 Slide

© 2006 Thomson South-Western. All Rights Reserved.

1

10,00015,000 14,000 8,000 18,000 12,000 6,000 16,000 21,000

2

3

4

Problem Formulation

40 customers per hour (s1)

Design A (d1)

Design B (d2)

Design C (d3)

Decision Tree

60 customers per hour (s2)80 customers per hour (s3)

40 customers per hour (s1)60 customers per hour (s2)80 customers per hour (s3)

40 customers per hour (s1)60 customers per hour (s2)80 customers per hour (s3)

Page 12: Slides prepared by JOHN  LOUCKS St. Edward’s University

12 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Decision Making without Probabilities

Three commonly used criteria for decisionmaking when probability information regarding thelikelihood of the states of nature is unavailable are:

• the optimistic (maximax) approach• the conservative (maximin) approach• the minimax regret approach.

Criteria for Decision Making

Page 13: Slides prepared by JOHN  LOUCKS St. Edward’s University

13 Slide

© 2006 Thomson South-Western. All Rights Reserved.

The optimistic approach would be used by an optimistic decision maker.

The decision with the overall largest payoff is chosen.

If the payoff table is in terms of costs, the decision with the overall lowest cost will be chosen (hence, a minimin approach).

Optimistic (Maximax) Approach

Decision Making without Probabilities

Page 14: Slides prepared by JOHN  LOUCKS St. Edward’s University

14 Slide

© 2006 Thomson South-Western. All Rights Reserved.

The decision that has the largest single value in the payoff table is chosen.

Maximax

payoff

Maximaxdecisio

n

Optimistic (Maximax) Approach

Decision Making without Probabilities

States of Nature Decision (Customers Per Hour)Alternative 40 s1 60 s2 80 s3

Design A d1 10,000 15,000 14,000Design B d2 8,000 18,000 12,000Design C d3 6,000 16,000 21,000

Page 15: Slides prepared by JOHN  LOUCKS St. Edward’s University

15 Slide

© 2006 Thomson South-Western. All Rights Reserved.

The conservative approach would be used by a conservative decision maker.

For each decision the minimum payoff is listed.

The decision corresponding to the maximum of these minimum payoffs is selected.

If payoffs are in terms of costs, the maximum costs will be determined for each decision and then the decision corresponding to the minimum of these maximum costs will be selected. (Hence, a minimax approach)

Decision Making without Probabilities Conservative (Maximin)

Approach

Page 16: Slides prepared by JOHN  LOUCKS St. Edward’s University

16 Slide

© 2006 Thomson South-Western. All Rights Reserved.

List the minimum payoff for each decision. Choose the decision with the maximum of these minimum payoffs.

Conservative (Maximin) Approach

Decision Making without Probabilities

Maximinpayoff

Maximindecisio

n Decision MinimumAlternative PayoffDesign A d1 10,000Design B d2 8,000Design C d3 6,000

Page 17: Slides prepared by JOHN  LOUCKS St. Edward’s University

17 Slide

© 2006 Thomson South-Western. All Rights Reserved.

The minimax regret approach requires the construction of a regret table or an opportunity loss table.

This is done by calculating for each state of nature the difference between each payoff and the largest payoff for that state of nature.

Then, using this regret table, the maximum regret for each possible decision is listed.

The decision corresponding to the minimum of the maximum regrets is chosen.

Decision Making without Probabilities Minimax Regret Approach

Page 18: Slides prepared by JOHN  LOUCKS St. Edward’s University

18 Slide

© 2006 Thomson South-Western. All Rights Reserved.

First compute a regret table by subtracting each payoff in a column from the largest payoff in that column. The resulting regret table is:

Decision Making without Probabilities Minimax Regret Approach

States of Nature Decision (Customers Per Hour)Alternative 40 s1 60 s2 80 s3

Design A d1 0 3,000 7,000Design B d2 2,000 0 9,000Design C d3 4,000 2,000 0

Page 19: Slides prepared by JOHN  LOUCKS St. Edward’s University

19 Slide

© 2006 Thomson South-Western. All Rights Reserved.

For each decision list the maximum regret. Choose the decision with the minimum of these values.

Decision Making without Probabilities Minimax Regret Approach

Minimaxregret

Minimaxdecisio

n

Decision MaximumAlternative RegretDesign A d1 7,000Design B d2 9,000Design C d3 4,000

Page 20: Slides prepared by JOHN  LOUCKS St. Edward’s University

20 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Decision Making with Probabilities

1 21

( ) ( ) ( ) ( ) 1N

j Nj

P s P s P s P s

Once we have defined the decision alternatives and states of nature for the chance events, we focus on determining probabilities for the states of nature. The classical, relative frequency, or subjective method of assigning probabilities may be used. Because only one of the N states of nature can occur, the probabilities must satisfy two conditions:

P(sj) > 0 for all states of nature

Assigning Probabilities

Page 21: Slides prepared by JOHN  LOUCKS St. Edward’s University

21 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Decision Making with Probabilities

We use the expected value approach to identify the best or recommended decision alternative. The expected value of each decision alternative is calculated (explained on the next slide). The decision alternative yielding the best expected value is chosen.

Expected Value Approach

Page 22: Slides prepared by JOHN  LOUCKS St. Edward’s University

22 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Expected Value Approach

EV( ) ( )d P s Vi j ijj

N

1

EV( ) ( )d P s Vi j ijj

N

1

where: N = the number of states of nature P(sj ) = the probability of state of

nature sj

Vij = the payoff corresponding to decision alternative di and state of nature sj

The expected value (EV) of decision alternative di is defined as

The expected value of a decision alternative is the sum of the weighted payoffs for the decision alternative.

Page 23: Slides prepared by JOHN  LOUCKS St. Edward’s University

23 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Expected Value Approach Calculate the expected value (EV) for

each decision. The decision tree on the next slide can assist

in this calculation. Here d1, d2, d3 represent the decision

alternatives of Designs A, B, and C. And s1, s2, s3 represent the states of nature of

40, 60, and 80 customers per hour. The decision alternative with the greatest EV

is the optimal decision.

Page 24: Slides prepared by JOHN  LOUCKS St. Edward’s University

24 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Expected Value Approach

1

10,00015,000 14,000 8,000 18,000 12,000 6,000 16,000 21,000

2

3

4

Design A (d1)

Design B (d2)

Design C (d3)

Decision Tree 40 customers (s1) P(s1) = .4

60 customers (s2) P(s2) = .280 customers (s3) P(s3) = .440 customers (s1) P(s1) = .460 customers (s2) P(s2) = .280 customers (s3) P(s3) = .440 customers (s1) P(s1) = .460 customers (s2) P(s2) = .280 customers (s3) P(s3) = .4

Page 25: Slides prepared by JOHN  LOUCKS St. Edward’s University

25 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Expected Value Approach

EV(d1) = .4(10,000) + .2(15,000) + .4(14,000) = $12,600

EV(d2) = .4(8,000) + .2(18,000) + .4(12,000) = $11,600

EV(d3) = .4(6,000) + .2(16,000) + .4(21,000) = $14,000

Design A d1

Design B d2

Design C d3

2

1

4

Choose the decision alternative with the largest EV:Design C

3

Page 26: Slides prepared by JOHN  LOUCKS St. Edward’s University

26 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Expected Value of Perfect Information Frequently information is available which can

improve the probability estimates for the states of nature.

The expected value of perfect information (EVPI) is the increase in the expected profit that would result if one knew with certainty which state of nature would occur.

The EVPI provides an upper bound on the expected value of any sample or survey information.

Page 27: Slides prepared by JOHN  LOUCKS St. Edward’s University

27 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Expected value of perfect information is defined as

Expected Value of Perfect Information

EVPI = |EVwPI – EVwoPI|

EVPI = expected value of perfect information EVwPI = expected value with perfect information about the states of natureEVwoPI = expected value without perfect

information about the states of nature

where:

Page 28: Slides prepared by JOHN  LOUCKS St. Edward’s University

28 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Expected Value of Perfect Information EVPI Calculation

• Step 1:Determine the optimal return

corresponding to each state of nature.• Step 2:

Compute the expected value of these optimal returns.

• Step 3:Subtract the EV of the optimal

decision from the amount determined in step (2).

Page 29: Slides prepared by JOHN  LOUCKS St. Edward’s University

29 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Calculate the expected value for the optimum payoff for each state of nature and subtract the EV of the optimal decision.

Expected Value of Perfect Information EVPI Calculation

EVPI= .4(10,000) + .2(18,000) + .4(21,000) - 14,000 = $2,000

Page 30: Slides prepared by JOHN  LOUCKS St. Edward’s University

30 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Risk Analysis Risk analysis helps the decision maker

recognize the difference between:• the expected value of a decision alternative,

and• the payoff that might actually occur

The risk profile for a decision alternative shows the possible payoffs for the decision alternative along with their associated probabilities.

Page 31: Slides prepared by JOHN  LOUCKS St. Edward’s University

31 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Risk Analysis Risk Profile for Decision Alternative

d3

.10

.20

.30

.40

.50

5 10 15 20 25

Prob

abilit

y

Profit ($ thousands)

Page 32: Slides prepared by JOHN  LOUCKS St. Edward’s University

32 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Sensitivity Analysis Sensitivity analysis can be used to determine

how changes to the following inputs affect the recommended decision alternative:• probabilities for the states of nature• values of the payoffs

If a small change in the value of one of the inputs causes a change in the recommended decision alternative, extra effort and care should be taken in estimating the input value.

Page 33: Slides prepared by JOHN  LOUCKS St. Edward’s University

33 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Sensitivity Analysis

EV(d1) .35 .30 .35.333 .333 .333 .40 .30 .30 .50 .25 .25 .60 .20 .20 .25 .50 .25 .20 .60 .20 .15 .70 .15

12,40012,65412,20011,50010,80014,00014,80015,600

P(s1)

Resolving Using Different Values for the

Probabilities of the States of Nature

12,90012,98712,70012,25011,80013,50013,80014,100

14,25014,31913,50012,25011,00014,75015,00015,250

P(s2) P(s3) EV(d2) EV(d3)d3

d3

d3

d1 and d3

d1

d3

d3

d2

Optimal d

Page 34: Slides prepared by JOHN  LOUCKS St. Edward’s University

34 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Decision Analysis With Sample Information

Knowledge of sample (survey) information can be used to revise the probability estimates for the states of nature.

Prior to obtaining this information, the probability estimates for the states of nature are called prior probabilities.

With knowledge of conditional probabilities for the outcomes or indicators of the sample or survey information, these prior probabilities can be revised by employing Bayes' Theorem.

The outcomes of this analysis are called posterior probabilities or branch probabilities for decision trees.

Page 35: Slides prepared by JOHN  LOUCKS St. Edward’s University

35 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Burger Prince must decide whether to purchase a

marketing survey from Stanton Marketing for$1,000. The results of the survey are

"favorable“or "unfavorable". The branch probabilitiescorresponding to all the chance nodesare listed on the next slide.

Decision Analysis With Sample Information

Example: Burger Prince

Page 36: Slides prepared by JOHN  LOUCKS St. Edward’s University

36 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Decision Analysis With Sample Information

Branch Probabilities

P(80 customers per hour | unfavorable) = .087P(60 customers per hour | unfavorable) = .217P(40 customers per hour | unfavorable) = .696

P(80 customers per hour | favorable) = .667P(60 customers per hour | favorable) = .185P(40 customers per hour | favorable) = .148

P(Unfavorable market survey) = .46P(Favorable market survey) = .54

Page 37: Slides prepared by JOHN  LOUCKS St. Edward’s University

37 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Restaurant Design(seating capacity) Profit

Avg. Numberof Customers

Per Hour

MarketSurveyResults

MarketSurvey

DecisionChanceConsequence

Decision Analysis With Sample Information

Influence Diagram

Page 38: Slides prepared by JOHN  LOUCKS St. Edward’s University

38 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Decision Tree (top half)

Decision Analysis With Sample Information

2

10,000 15,000 14,000 8,000 18,000 12,000 6,000 16,000 21,000

4

5

6

d1

d2

d3

s1 P(s1|I1) = .148s2 P(s2|I1) = .185s3 P(s3|I1) = .667s1 P(s1|I1) = .148s2 P(s2|I1) = .185s3 P(s3|I1) = .667s1 P(s1|I1) = .148s2 P(s2|I1) = .185s3 P(s3|I1) = .6671

P(I1) = .54I1

Page 39: Slides prepared by JOHN  LOUCKS St. Edward’s University

39 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Decision Tree (bottom half)

Decision Analysis With Sample Information

3

10,000 15,000 14,000 8,000 18,000 12,000 6,000 16,000 21,000

7

8

9

d1

d2

d3

s1 P(s1|I2) = .696s2 P(s2|I2) = .217s3 P(s3|I2) = .087s1 P(s1|I2) = .696s2 P(s2|I2) = .217s3 P(s3|I2) = .087s1 P(s1|I2) = .696s2 P(s2|I2) = .217s3 P(s3|I2) = .087

1

P(I2) = .46I2

Page 40: Slides prepared by JOHN  LOUCKS St. Edward’s University

40 Slide

© 2006 Thomson South-Western. All Rights Reserved.

• A decision strategy is a sequence of decisions and chance outcomes.

• The sequence of decisions chosen depends on the yet to be determined outcomes of chance events.

• The EVwSI is calculated by making a backward pass through the decision tree.

Decision Analysis With Sample Information

Decision Strategy

• The optimal decision strategy is based on the Expected Value with Sample Information (EVwSI).

Page 41: Slides prepared by JOHN  LOUCKS St. Edward’s University

41 Slide

© 2006 Thomson South-Western. All Rights Reserved.

• Step 1:Determine the optimal decision strategy and its expected returns for the possible outcomes of the sample using the posterior probabilities for the states of nature.

• Step 2: Compute the expected value of these optimal returns.

Expected Value with Sample Information (EVwSI)

Decision Analysis With Sample Information

Page 42: Slides prepared by JOHN  LOUCKS St. Edward’s University

42 Slide

© 2006 Thomson South-Western. All Rights Reserved.

I2(.46)

d1

d2

d3

EV = .696(10,000) + .217(15,000) +.087(14,000) = $11,433

EV = .696(8,000) + .217(18,000) + .087(12,000) = $10,554

EV = .696(6,000) + .217(16,000) +.087(21,000) = $9,475

I1(.54)

d1

d2

d3

EV = .148(10,000) + .185(15,000) + .667(14,000) = $13,593

EV = .148 (8,000) + .185(18,000) + .667(12,000) = $12,518

EV = .148(6,000) + .185(16,000) +.667(21,000) = $17,855

4

5

6

7

8

9

2

3

1

$17,855

$11,433

Decision Analysis With Sample Information

Page 43: Slides prepared by JOHN  LOUCKS St. Edward’s University

43 Slide

© 2006 Thomson South-Western. All Rights Reserved.

I2(.46)

d1

d2

d3

$11,433

$10,554

$ 9,475

I1(.54)

d1

d2

d3

$13,593

$12,518

$17,855

4

5

6

7

8

9

2

3

1

$17,855

$11,433

Decision Analysis With Sample Information

EVwSI = .54(17,855) + .46(11,433)= $14,900.88

Page 44: Slides prepared by JOHN  LOUCKS St. Edward’s University

44 Slide

© 2006 Thomson South-Western. All Rights Reserved.

If the outcome of the survey is "favorable”,choose Design C. If the outcome of the survey is “unfavorable”, choose Design A.

EVwSI = .54($17,855) + .46($11,433) = $14,900.88

Decision Analysis With Sample Information

Expected Value with Sample Information (EVwSI)

Optimal Decision Strategy

Page 45: Slides prepared by JOHN  LOUCKS St. Edward’s University

45 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Decision Analysis With Sample Information

PayoffI1 = .54I1 = .54I1 = .54I2 =.46I2 =.46I2 =.46

$ 6,000$16,000$21,000$10,000$15,000$14,000

.08 .10 .36 .32 .10 .04----------------

1.00

Risk Profile for Optimal Decision Strategy

( )P I sP(I)P(s1|I1) = .148P(s2|I1) = .185P(s3|I1) = .667P(s1|I2) = .696P(s2|I2) = .217P(s3|I2) = .087

P(s|I)

Payoffsfor d3

Payoffsfor d1

Page 46: Slides prepared by JOHN  LOUCKS St. Edward’s University

46 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Decision Analysis With Sample Information

Risk Profile for Optimal Decision Strategy

.10

.20

.30

.40

.50

5 10 15 20 25

Prob

abilit

y

Profit ($ thousands)

.08

.32

.04

.36

.10.10

Page 47: Slides prepared by JOHN  LOUCKS St. Edward’s University

47 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Expected Value of Sample Information The expected value of sample information

(EVSI) is the additional expected profit possible through knowledge of the sample or survey information.

EVSI = |EVwSI – EVwoSI|

EVSI = expected value of sample information EVwSI = expected value with sample information about the states of natureEVwoSI = expected value without sample

information about the states of nature

where:

Page 48: Slides prepared by JOHN  LOUCKS St. Edward’s University

48 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Expected Value of Sample Information

Subtract the EVwoSI (the value of the optimal decision obtained without using the sample information) from the EVwSI.

EVSI Calculation

EVSI = $14,900.88 - $14,000 = $900.88

ConclusionBecause the EVSI ($900.88) is less than the cost of the survey ($1000.00), the survey should not be purchased.

Page 49: Slides prepared by JOHN  LOUCKS St. Edward’s University

49 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Efficiency of Sample Information The efficiency rating (E) of sample

information is the ratio of EVSI to EVPI expressed as a percent.

The efficiency rating (E) of the market survey for Burger Prince Restaurant is:

EVSIE 100EVPI

900.88E 100 45%2000.00

Page 50: Slides prepared by JOHN  LOUCKS St. Edward’s University

50 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Bayes’ Theorem can be used to compute branch probabilities for decision trees.

For the computations we need to know:• the initial (prior) probabilities for the states

of nature,• the conditional probabilities for the

outcomes or indicators of the sample information, given each state of nature.

A tabular approach is a convenient method for carrying out the computations.

Computing Branch Probabilities

Page 51: Slides prepared by JOHN  LOUCKS St. Edward’s University

51 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Step 1For each state of nature, multiply the prior probabilityby its conditional probability for the indicator. Thisgives the joint probabilities for the states and indicator.

Step 2Sum these joint probabilities over all states. This givesthe marginal probability for the indicator.

Step 3For each state, divide its joint probability by themarginal probability for the indicator. This gives theposterior probability distribution.

Computing Branch Probabilities

Page 52: Slides prepared by JOHN  LOUCKS St. Edward’s University

52 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Recall that Burger Prince is considering purchasing

a marketing survey from Stanton Marketing. Theresults of the survey are "favorable“ or

"unfavorable".The conditional probabilities are:

Example: Burger Prince Restaurant

P(favorable |80 customers per hour) = .9P(favorable |60 customers per hour) = .5P(favorable |40 customers per hour) = .2

Compute the branch (posterior) probabilitydistribution.

Computing Branch Probabilities

Page 53: Slides prepared by JOHN  LOUCKS St. Edward’s University

53 Slide

© 2006 Thomson South-Western. All Rights Reserved.

State Prior Conditional Joint PosteriorFavorable

.08

.10

.36

.148

.185

.6671.000

406080

.4 .2 .4

.2 .5 .9

Posterior Probability Distribution

Computing Branch Probabilities

P(favorable) = .54

Total .54

.08/.54

Page 54: Slides prepared by JOHN  LOUCKS St. Edward’s University

54 Slide

© 2006 Thomson South-Western. All Rights Reserved.

Total .46

State Prior Conditional Joint PosteriorUnfavorable

.32

.10

.04

.696

.217

.0871.000

406080

.4 .2 .4

.8 .5 .1

Posterior Probability Distribution

Computing Branch Probabilities

P(unfavorable) = .46

.32/.46

Page 55: Slides prepared by JOHN  LOUCKS St. Edward’s University

55 Slide

© 2006 Thomson South-Western. All Rights Reserved.

End of Chapter 4