纳什均衡解的另一种解法

发布时间：2018-04-22 22:03

本文选题：博弈论 + 纳什均衡　；参考：《统计与决策》2017年15期

【摘要】：文章把图论的知识运用到求二人完全信息静态博弈的纳什均衡解过程中,提出了一种新的求纳什均衡解的方法,证明了求纳什均衡解问题等价于求解有向图的汇点问题。这种方法是基于重复剔除劣策略的基础上的一种改进。在此基础上,给出了一般算法。
[Abstract]:In this paper, the knowledge of graph theory is applied to the process of finding Nash equilibrium solution of static game with complete information of two persons, and a new method of finding Nash equilibrium solution is proposed. It is proved that the problem of finding Nash equilibrium solution is equivalent to solving the meeting point problem of directed graph. This method is an improvement based on repeated rejection strategy. On this basis, the general algorithm is given.
【作者单位】：华南农业大学经济管理学院;
【基金】：国家社会科学基金资助项目(1210BJY055)
【分类号】：F224.32

【参考文献】