应用搜索博弈支持集和方程组求解技术,提出了一个计算单一和全部纳什均衡点的启发搜索方法.通过使用GAMUT提供的综合测试集进行测试,结果表明该算法与现有的几个纳什均衡算法相比具有优异的性能.
We propose a new algorithm for a sample and all Nash equilibria by using heuristic search in game supports and the solution techniques of polynomial equation systems. Also, by making use of GAMUT comprehensive test-bed, we show that this algorithm performs better than the other state-ofart algorithms.