00:01
Thing we'll do is to eliminate the dominated strategies.
00:03
So, we'll compare the rows for p strategies.
00:08
Strategy w is 0, negative 2, and 7.
00:20
Strategy for b is 2, 5, 6.
00:25
Strategy r is 3, negative 3, and 8.
00:35
And so, strategy w is dominated by b because b gives higher payoffs than w for all q's strategy.
00:48
So for q choosing w, we have b of 2 greater than w of 0.
00:57
For q choosing b, we have b of 5 is greater than w of negative 2.
01:07
For q choosing r, b of 6 is less than than w of 7.
01:23
But b is generally better.
01:26
So we'll eliminate strategy w for player p.
01:31
Now we'll compare the remaining roles for p's strategy, which is b and r.
01:39
But no domination is found between b and r.
01:42
And so the will do the revised payoff table p q b r w b r 2 5 6 3 negative 3 and 8 so that's a revised payoff table and we'll set up the linear programming problem so for p or the role player will maximize the minimum payoff to ensure the best strategy.
02:12
And so we'll let x1 and x2 be the probabilities that player p chooses strategy b and r respectively...