00:01
In this problem, we wish to decide whether the game is strictly determined, where the game is the 2x2 matrix with row player a and column player b on the right.
00:09
If it is strictly determined, we want to give the player's optimal strategies than the value or rather expected value of the game.
00:15
This question is challenging our understanding of matrix algebra and game theory.
00:18
In order to solve whether the game is strictly determined, we first have to reduce it by dominance, which proceeds in three steps listed here.
00:25
So reducing by dominance, first we note that q is less than equal to p, thus column q dominates p, and we're left with ab by p 1 -94.
00:32
Next, row a dominates row b because 1 is greater than negative 4, so we're left with the 1 -by -1 matrix 1 through row reduction by dominant...