91影视

The payoff matrix had rows and columns that make a move for winning. Row and columns have a mixed strategy to win the game. By observing the opponent鈥檚 moves, strategies are predicted. The average payoff is represented as follows,

$\underset{\mathbf{i}\mathbf{,}\mathbf{j}}{\mathbf{鈭�}}{\mathit{G}}_{\mathbf{I}\mathbf{j}}\mathbf{.}\mathit{P}\left[Rows,column\right]\mathbf{=}\underset{\mathbf{i}\mathbf{,}\mathbf{j}}{\mathbf{鈭�}}{\mathit{G}}_{\mathbf{I}\mathbf{j}}{\mathit{x}}_{\mathbf{i}}{\mathit{y}}_{\mathbf{j}}$ ......(1)

The given payoff matrix is more significant, with eight rows and four columns. The larger matrix is reduced by the dominance of the probability of rows and columns.

Sum the row and column values, and delete the rows and columns with the least values.

$$\begin{gathered} \left[\begin{array}{cccc}0& 0& 鈥�1& 鈥�1\\ 0& 1& 鈥�2& 鈥�1\\ 鈥�1& 鈥�1& 1& 1\\ 鈥�1& 0& 0& 1\\ 1& 鈥�2& 0& 鈥�3\\ 1& 鈥�1& 鈥�1& 鈥�1\\ 0& 鈥�3& 2& 鈥�1\\ 0& 鈥�2& 1& 鈥�1\end{array}\right]\begin{array}{c}鈥�2\\ 鈥�2\\ 0\\ 0\\ 鈥�4\\ 鈥�2\\ 鈥�2\\ 鈥�2\end{array} \\ 0鈥�80鈥�6 \end{gathered}$$

The reduced matrix after deleting the dominance is $\left[\begin{array}{cc}鈥�1& 1\\ 鈥�1& 0\end{array}\right]$

The row min max of the matrix $\left[\begin{array}{cc}鈥�1& 1\\ 鈥�1& 0\end{array}\right]$is -1, The column max min of the matrix is -1.

$$\begin{gathered} rowminmax=columnmaxmin \\ -1=-1 \end{gathered}$$

The above value is denoted as, $G_{ij}=-1$ ......(2)

From the given mixed strategies $\left(\frac{1}{3},0,0,\frac{1}{2},\frac{1}{6},0,0,0\right)$and $\left(\frac{2}{3},0,0,\frac{1}{3}\right),$

$$\begin{gathered} \frac{1}{3}+0+0+\frac{1}{2}+\frac{1}{6}+0+0+0=1 \\ \frac{2}{3}+0+0+\frac{1}{3}=1 \end{gathered}$$

Substitute the values of mixed strategies sums and the value of Equation (2) in Equation (1).

$$\begin{gathered} \underset{\mathrm{i},\mathrm{j}}{鈭�}{\mathrm{G}}_{\mathrm{Ij}}.\mathrm{P}[\mathrm{Rows},\mathrm{column}]=\underset{\mathrm{i},\mathrm{j}}{鈭�}{\mathrm{G}}_{\mathrm{Ij}}{\mathrm{x}}_{\mathrm{i}}{\mathrm{y}}_{\mathrm{j}} \\ \underset{}{鈭�(-1)\left(\frac{1}{3}+0+0+\frac{1}{2}+\frac{1}{6}+0+0+0\right).\left(\frac{2}{3}+0+0+\frac{1}{3}=1\right)=}\underset{\mathrm{i},\mathrm{j}}{鈭�}{\mathrm{G}}_{\mathrm{Ij}}{\mathrm{x}}_{\mathrm{i}}{\mathrm{y}}_{\mathrm{j}} \end{gathered}$$

Solving the above equation,

$\underset{\mathrm{i},\mathrm{j}}{鈭�}{\mathrm{G}}_{\mathrm{Ij}}{\mathrm{x}}_{\mathrm{i}}{\mathrm{y}}_{\mathrm{j}}=-1$

Therefore, the value of the game is -1 by reducing dominance. Otherwise, without a reduction solution, a payoff matrix is not possible.