Computing Simply Stable Equilibria
针对两人博弈，提出一种线性规划算法，找出纳什均衡的一个分量及其中的完美均衡子集，这些均衡在某个策略的概率或收益被扰动时仍有邻近均衡。
For each two-player game, a linear-programming algorithm finds a component of the Nash equilibria and a subset of its perfect equilibria that are simply stable in the sense that there are nearby equilibria for each nearby game that perturbs one strategy's probability or payoff more than others. Copyright 1992 by The Econometric Society.