期刊
ANNALS OF OPERATIONS RESEARCH
卷 137, 期 1-4, 页码 349-368出版社
SPRINGER
DOI: 10.1007/s10479-005-2265-4
关键词
computation of all equilibria; noncooperative game theory
In this paper we present an algorithm to compute all Nash equilibria for generic finite n-person games in normal form. The algorithm relies on decomposing the game by means of support-sets. For each support-set, the set of totally mixed equilibria of the support-restricted game can be characterized by a system of polynomial equations and inequalities. By finding all the solutions to those systems, all equilibria are found. The algorithm belongs to the class of homotopy-methods and can be easily implemented. Finally, several techniques to speed up computations are proposed.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据