00:01
We have to find each player's optimal strategy and the value of the two -person zero game and the table is as shown below.
00:30
Now we can write the reward matrix as a equal to 1, 2 minus 1, 1 minus 1, 2, 1.
00:48
Let x1, x2 be the optimal strategy of row player and y1, y2, y3 be the optimal strategy of column player and column player's third pure strategy is dominated with his pure strategy since 1, 1 is greater than equal to 1 by 2, minus 1.
01:54
So x3 equal to 0 and we can observe reward matrix as a1 equal to 1 by 2, minus 1, minus 1, 2.
02:16
We cannot reduce it further.
02:24
So we got a 2 cross 2 matrix.
02:29
Now let the players a and b play their strategies 1 and 2 with probabilities x, 1 by x, y, 1 minus x, y, 1 minus y.
03:07
Thus we can write this as 1 upon 2, minus 1, minus 1, 2, x, 1 minus x, y, 1 minus y...