AI helps you reading Science
Computing Nash Equilibria of Action-Graph Games
Dagstuhl Seminars, pp.35-42, (2005)
EI
Keywords
Abstract
Abstract complexity of Govindan and Wilson's algorithm is open because the worst - case number of gradient - following steps is not known; however, in practice the algorithm's runtime Action - graph games (AGGs) are a fully expres - sive game representation which can compactly express both strict and context - specific indepen...More
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn