Decision Analysis 1.1 (Costs) - Optimistic, Conservative, Minimax Regret - YouTube

Channel: Joshua Emmanuel

[0]
Welcome! In this brief video, we will be discussing
[3]
decision making without probabilities where cost is involved.
[8]
We will cover the Optimistic or Maximax approach, the Conservative or Maximin approach,
[15]
and also the Minimax Regret approach.
[19]
We will be using this payoff table where Payoffs are costs.
[23]
The approach we will use in this tutorial is applicable to all cases where smaller payoff
[29]
values are preferred over larger ones. The objective could be to minimize cost, minimize
[36]
customer waiting time, minimize risk, minimize distance, and so on.
[43]
The Optimistic or Maximax Approach Using this approach we choose the alternative
[49]
with the best of the best payoffs. Note that the payoffs are costs, therefore the smaller
[55]
the better. For d1 , the best payoff is -5
[60]
For d2 , the best is -9 and for d3, the best is -5.
[67]
The overall best is -9. Therefore the optimistic decision is to choose d2.
[77]
The Conservative or Maximin Approach Using this approach, we choose the alternative
[82]
that has best of the worst payoffs. We first choose the worst payoff in each alternative,
[89]
and then choose the best of them. Since these are costs, for d1, the worst is
[96]
14 for d2 , the worst is 15
[99]
and for d3, the worst is 18. The best of these worst payoffs is 14
[107]
Therefore the conservative decision is to choose d1.
[113]
The Minimax Regret Approach Using this approach, we choose the alternative
[118]
with the minimum of all the maximum regrets across all alternatives.
[123]
Regret is the difference between the best payoff and the actual payoff received in a
[129]
particular state of nature.
[131]
Therefore for s1 the best payoff is 5 since we are dealing with costs.
[137]
That is, if you knew s1 was going to occur, you would have chosen d3.
[143]
So if s1 occurs and you already chose d1, your regret will be 12 – 5 = 7.
[150]
That is, if you could pay $5 for an item and you paid $12 instead, your regret will be $7
[160]
Note that if these are profits, we will subtract all payoffs from the best, which in that case
[167]
would be the largest value. But because they are costs, we will subtract the smallest from
[173]
other payoffs. Whatever you do, make sure your regret values are not negative.
[179]
So going back to s1 If instead you chose d2, you’re paying $15
[185]
when you could pay $5 and your regret will be 15 – 5 which equals 10.
[192]
And if you chose d3, your regret is 5 – 5 which equals 0. That is, there is no regret.
[201]
For s2 your best payoff is -5.
[205]
So if you chose d1, your regret will be -5 minus -5 which equals 0 → no regret.
[214]
Note that the double negative becomes positive. And you if you chose d2, your regret is 11
[220]
minus -5 which equals 16. If you chose d3, your regret will be 18 minus
[227]
-5 which equals 23.
[230]
If s3 occurs, the best payoff is -9.
[234]
So if you chose d1, your regret will be 14 minus -9 which gives 23.
[240]
And you if you chose d2, your regret is -9 minus -9 which equals 0.
[247]
If you chose d3, your regret will be -5 minus -9 which equals 4
[254]
Here is the Regret Table. Note that after regrets are calculated, the
[260]
approach for determining the best alternative is exactly the same for profit and cost problems.
[267]
Since the decision is to be made based on minimax regret, we first determine the maximum
[274]
regret for each alternative, and then choose the minimum.
[277]
For d1, the maximum regret is 23, for d2, the maximum is 16,
[283]
for d3, the maximum regret is 23. The minimum of these maximum regrets is 16.
[291]
Therefore the minimax regret decision is to choose d2.
[296]
Please leave your comments or questions below.
[299]
Thanks for watching.