Settling the Complexity of 2-Player Nash-Equilibrium
Electronic Colloquium on Computational Complexity (ECCC)（2005）
摘要
We prove that nding a solution of two player Nash Equilibrium is PPAD-complete.
更多查看译文
关键词
nash equilibrium
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要