Author:
Chen Xi,Deng Xiaotie,Teng Shang-Hua
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Goldberg, P., Papadimitriou, C.: Reducibility among equilibrium problems. In: STOC 2006 (2006)
2. Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a nash equilibrium. In: STOC 2006 (2006)
3. Papadimitriou, C.: On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, 498–532 (1994)
4. Chen, X., Deng, X.: 3-nash is ppad-complete. In: ECCC, TR05-134 (2005)
5. Daskalakis, C., Papadimitriou, C.: Three-player games are hard. In: ECCC, TR05-139 (2005)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献