摘要
本文借助“Ｆａｋａｒｓ定理”［２］的思想，给出了矩阵对策中局中人的某一纯策略可被其余纯策略的凸线性组合所优超的充分必要条件。
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.
出处
《南通工学院学报》
1997年第1期5-8,共4页
Journal of Nantong Institute of Technology
