【摘要】 本文论证了有关矩阵对策的解的几种不同定义的等价性,并应用线性规划和代数的不同方法,探讨了矩阵对策的收益期望函数在策略集上的极大(小)点的重要性质,从而获得了矩阵对策的解(X ,Y)的一个充要条件: minE(X,β_j)=maxE(α_i,Y)更多还原

【Abstract】 This paper proves that the several different definitios about the solution of matrix game are equivalent each other. Then, using the different methods of linear programming and algebra, it researches the important property about the maximum(minimum) points of the expectation income function, which belongs to the strategy set of matrix game. And so, it is deduced that the following formula is the necessary and sufficient condition for the solution (X,Y)of matrix game:更多还原