纳什均衡解的另一种解法

Another Solving Method of Nash Equilibrium

文章把图论的知识运用到求二人完全信息静态博弈的纳什均衡解过程中,提出了一种新的求纳什均衡解的方法,证明了求纳什均衡解问题等价于求解有向图的汇点问题。这种方法是基于重复剔除劣策略的基础上的一种改进。在此基础上,给出了一般算法。

This paper applies the knowledge of graph theory to the solving of the Nash equilibrium of the two-person complete information static game, and proposes a new solving method of Nash equilibrium. The paper also seeks confirmation that the solving of Nash equilibrium is equivalent to the finding of the sinks of directed graph. The proposed method is an improvement based on the repeated elimination of bad strategy. And finally on this basis the paper offers a general algorithm.