arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1006.5352cs.GTcs.CC
收藏

同伦方法的复杂性、平衡选择和Lemke-Howson解

The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions

Paul W. Goldberg, Christos H. Papadimitriou, Rahul Savani

摘要:

我们表明,广泛使用的同伦方法解决不动点问题,以及游戏的Harsanyi-Selten平衡选择过程,是PSPACE完全实现。扩展我们的结果的Harsanyi-Selten过程中,我们表明,其他几个同伦为基础的算法,寻找游戏的均衡也PSPACE完全实现。我们的技术的进一步应用产生的结果是,它是PSPACE-完全的计算任何平衡,可以通过经典的Lemke-Howson算法,一个复杂性理论的结果加强[Savani和冯Stengel]。这些结果表明,我们的技术可以被广泛应用,并建议,PSPACE完备性实现同伦方法是一个普遍的原则。

英文摘要:

We show that the widely used homotopy method for solving fixpoint problems, as well as the Harsanyi-Selten equilibrium selection process for games, are PSPACE-complete to implement. Extending our result for the Harsanyi-Selten process, we show that several other homotopy-based algorithms for finding equilibria of games are also PSPACE-complete to implement. A further application of our techniques yields the result that it is PSPACE-complete to compute any of the equilibria that could be found via the classical Lemke-Howson algorithm, a complexity-theoretic strengthening of the result in [Savani and von Stengel]. These results show that our techniques can be widely applied and suggest that the PSPACE-completeness of implementing homotopy methods is a general principle.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑