Business Analytics: Decision Analysis Techniques
Business Analytics: Decision Analysis Techniques
1
Today’s Objectives
1. Use probabilities to determine optimal decisions under uncertainty (based on
expected value criterion) .
2
The Science of Decision Making
▪ Making a decision is basically making a choice.
– Whether to pursue a graduate study
– Whether to buy a stock and how much money to invest
– Whether to expand the product line and how to expand
3
Thompson Lumber Company
STATE OF NATURE
4
Thompson Lumber Company
▪ List all possible alternatives
– Defined as a course of action or strategy that decision maker can choose.
– E.g. (1) large plant (2) small plant (3) no plant
▪ Identify possible outcomes/states of nature
– E.g. Market could be (a) favorable (b) unfavorable for the new product
▪ List the payoff
– Conditional values
STATE OF NATURE
STATE OF NATURE Expected
FAVORABLE MARKET UNFAVORABLEMonetary MARKET
ALTERNATIVE (profit
FAVORABLE MARKET in $) UNFAVORABLE (profit in $) Value
ALTERNATIVE (profit in $) MARKET (profit in $) (EMV, $)
Construct a large plant 200,000 –180,000
Construct a large
Construct plantplant
a small 200,000100,000 –180,000 –20,000 –9,000
Construct a small plant
Do nothing 100,000 0 –20,000 34,000
0
Do nothing 0 0 0
Probability 0.45 0.55
5
Types of Decision-Making Environments
▪ Decision making under certainty
– The decision maker knows with certainty the consequences of every alternative
or decision choice.
– E.g. saving accounts/government bond with fixed interest
6
Decision Making under Risk
7
Decision Making under Risk
▪ Scientific Marketing, Inc. offers analysis that will provide certainty about
market conditions. S.M. would charge $65,000 for the information. Should
John buy the information?
▪ To make this decision, John has to evaluate the expected value of perfect
information (EVPI) by computing the expected value with perfect
information (EVwPI) and the best EMV under risk.
8
Decision Making under Risk
▪ EVwPI = σ best payoff in state 𝑖 ∙ probability of state 𝑖
▪ EVPI = expected value of perfect information
▪ EVPI = expected value with perfect information (EVwPI) – expected value
without perfect information (i.e. best EMV).
9
Decision Making under Risk
10
Decision Making under Risk
EVwPI
EOL EOL EOL
1 2 3
11
In-class Exercise: Café du Donut
▪ The Café buys donuts each day for $40 per carton of 20 dozen donuts. Any cartons
not sold are thrown away at the end of the day. If a carton is sold, the total revenue
is $60.
12
In-class Exercise: Café du Donut
▪ Monetary Payoff (Profit) Table
DD==44 D D
==5 5 D =D6= 6 D = D
7 = 7D = 8D = D
8 = 9 D =D9= 10D EMV
= 10 EMV
EOL
Q=6 0 60 120 120 120 120 120 105
Q=7 -40 20 80 140 140 140 140 104
Prob. 0.05
0.05 0.15
0.15 0.15
0.15 0.200.20 0.25 0.250.10 0.10
0.10 0.10
13
Decision Making under Risk
▪ If the estimation of probability is changed, how will John change his decision?
▪ A sensitivity analysis is needed!
STATE OF NATURE
14
Decision Making under Risk
EMV
$300,000
–$200,000
15
Results of Sensitivity Analysis
16
In-class Exercises
▪ The Monty Hall Problem Revisited
– 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, 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?
17
Decision Making under Uncertainty
What if we do not know the probabilities?
▪ Maximax (optimistic)
▪ Maximin (pessimistic)
▪ Criterion of realism (Hurwicz)
▪ Minimax regret
18
Decision Making under Uncertainty
▪ Maximax (optimistic)
STATE OF NATURE
Do nothing 0 0 0
19
Decision Making under Uncertainty
▪ Maximin (pessimistic)
STATE OF NATURE
Do nothing 0 0 0
20
Decision Making under Uncertainty
▪ Criterion of realism (Hurwicz)
– Select a coefficient of realism α, with 0 ≤ α ≤ 1.
– Weighted average = α(best in row) + (1 – α)(worst in row).
Do nothing 0 0 0
21
Decision Making under Uncertainty
▪ Minimax regret
– Based on opportunity loss or regret.
STATE OF NATURE
23
In-Class Exercise
24
Today’s Objectives
1. Use probabilities to determine optimal decisions under uncertainty (based on
expected value criterion) .
25
Decision Tree
▪ Any problem that can be presented in a decision table can also be
graphically illustrated in a decision tree.
26
Decision Making under Risk
27
Thompson’s Decision Tree
$0
28
Summer job decision
29
Bill’s decision criterion
30
Decision tree
31
Decision tree
32
Decision tree
33
Decision tree
▪ If Vanessa's firm were to make Bill a job offer, then Bill would subsequently
have to decide to accept or to reject the firm's job offer
▪ In this case, and if Bill were to accept the firm's job offer, then his summer job
problem would be resolved
▪ If Bill were to instead reject their offer, then Bill would then have to search for
summer employment through the school's corporate summer recruiting
program
34
Assigning probabilities
35
Decision tree
▪ Bill believes the likelihood that he would receive the indicated salaries if he were to
participate in the school's corporate summer recruiting is the similar to other MBA
students last year
▪ An end node (a triangle) indicates that the no further decisions or uncertain events
would emanate from there
36
Decision tree
▪ Bill needs to estimate the likelihood that Vanessa's firm will offer him a job
▪ On reflection, he believes Vanessa was impressed with him, and she sounded certain that she wanted to hire him
▪ However, the competition for investment banking jobs is very intense, and many of Bill's classmates are equally
talented
▪ Bill assigns the probability of receives a job offer from Vanessa's firm to be 60%
37
Decision tree
The next step in the decision analysis modelling methodology is to assign numerical
values to the outcomes associated with the end nodes, based on the decision criterion
that has been adopted
38
Key characteristics of a decision tree
▪ Time in a decision tree flows from left to right, and the placement of the
decision nodes and the event nodes is logically consistent with the way events
will play out in reality
– Any event or decision that must logically precede certain other events and decisions
is appropriately placed in the tree to reflect this logical dependence
▪ The branches emanating from each decision node represent all of the possible
decisions under consideration at that point in time under the appropriate
circumstances
– The branches emanating from each event node represent a set of mutually exclusive
and collectively exhaustive outcomes of the event node
– The sum of the probabilities of each outcome branch emanating from a given event
node must sum to one
▪ Each and every "final" branch of the decision tree has a numerical value
associated with it. This numerical value usually represents some measure of
monetary value, such as salary, revenue, cost, etc.
39
Expected monetary value (EMV)
▪ At node C of the decision tree, how would he decide between obtaining a summer
salary of $14,000 with certainty, and the distribution of possible salaries he might
obtain from participating in the school's corporate summer recruiting?
▪ A common criterion in this setting is to convert the distribution of possible salaries
to a single numerical value using the EMV of the possible outcomes
40
Expected monetary value (EMV)
▪ The EMV of an uncertain event is the weighted average of all possible numerical
outcomes, with the probabilities of each of the possible outcomes used as the weights
– The EMV of participating in corporate summer recruiting is:
EMV=0.05×21.6+0.25×16.8+0.40×12+0.25×6+0.05×0=11.58 (thousand
$)
41
Expected monetary value (EMV)
42
Folding back the decision tree
▪ Begin with the end nodes of the tree, and then work "backwards" to the
starting node
– Evaluate each event node using the EMV of the event node
– Evaluate each decision node by choosing that decision which has the best EMV
43
Folding back the decision tree
44
Folding back the decision tree
▪ Remove the inferior choice at each decision node by crossing off the branch
▪ The solution of the decision tree is a decision strategy, which states what decisions should be made
under each possible uncertain outcome that might prevail
45
Bill's optimal decision strategy
Accept John’s Offer Accept Vanessa’s Offer 5%
$12000 $14000 $21600
25%
Reject Offer Reject Vanessa’s $16800
$13032 $14000
John’s from Offer
$11580 40%
A Offer B C E $12000
Vanessa
60%
$13032 5% 25%
$21600 $6000
No Offer from
25% 5%
Vanessa $16800 $0
40%
40%
D $12000
$11580 25%
$6000
5% $0
46
Procedure for solving a decision tree
Accept John’s Offer Accept Vanessa’s Offer 5%
$12000 $14000 $21600
Reject John’s 25%
Offer from Reject Vanessa’s $16800
Offer $13032 Vanessa $14000 Offer $11580 40%
A B C E $12000
60% 25%
$13032 5% $6000
No Offer from $21600
Vanessa 25% 5%
$16800 $0
40%
D 40%
$12000
$11580 25%
$6000
5% $0
▪ Start with the end nodes of the decision tree, and evaluate each event node and each decision node
– For an event node, compute the EMV of the node by computing the weighted
average of the EMV of each branch weighted by its probability
– For a decision node, compute the EMV of the node by choosing that branch
emanating from the node with the best EMV value
▪ The decision tree is solved when all nodes have been evaluated
▪ The EMV of the optimal decision strategy is the EMV computed for the starting branch of the tree
47
Today’s Objectives
1. Use probabilities to determine optimal decisions under uncertainty (based on
expected value criterion) .
48