| 矩阵对策中纯策略可被优超的充要条件 |
| |
| 引用本文： | 陈斌. 矩阵对策中纯策略可被优超的充要条件[J]. 南通工学院学报(社会科学版), 1997, 13(1): 5-8 |
| |
| 作者姓名： | 陈斌 |
| |
| 作者单位： | 南通职业大学!南通226007 |
| |
| 摘 要： | 本文借助“Ｆａｋａｒｓ定理”的思想，给出了矩阵对策中局中人的某一纯策略可被其余策略的凸线性组合所优超的充分必要条件。
|
| 关 键 词： | 矩阵对策 优超纯策略 凸线性组合 纯策略 |
SUFFICIENT AND ESSENTIAL CONDITION FOR COVERING THE PURE STRATEGY IN THE MATRIX GAME |
| |
| Chen Bin. SUFFICIENT AND ESSENTIAL CONDITION FOR COVERING THE PURE STRATEGY IN THE MATRIX GAME[J]. Journal Of Nantong University(Education Sciences Edition), 1997, 13(1): 5-8 |
| |
| Authors: | Chen Bin |
| |
| Affiliation: | Nantong Professional College |
| |
| Abstract: | This paper, based on Fakars-theorem, gives the sufficient and essential condition under which a pure strategy can be covered by the convex linear combination of other strategies in the matrix game. |
| |
| Keywords: | matrix game optimal strategy convex linear combination |
| 本文献已被 CNKI 维普 等数据库收录！ |
