【摘要】 给出计算二人博弈问题中单一纳什均衡的一种搜索算法,用支付矩阵的秩数和条件占优行的个数限定待搜索策略对空间,将该空间按一定规则排序,通过对有序有限策略对空间进行搜索得到一个简单的纳什均衡.更多还原

【Abstract】 Nash Equilibria computing is one of the most important problems in non-cooperative games. In this paper, we give a searching algorithm for finding a simple Nash equilibrium in two-player games. We limit the searching strategy space according to rank and the conditionally dominant rows of the payoff matrix, order the space, and seach the limited and ordered strategy space for finding a simple Nash equilibrium.更多还原