Author:
Daskalakis Constantinos,Mehta Aranyak,Papadimitriou Christos
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Althofer, I.: On sparse approximations to randomized strategies and convex combinations. Linear Algebra and its Applications 199 (1994)
2. Caccetta, L., Haggkvist, R.: On minimal digraphs with given girth. Congressus Numerantium XXI (1978)
3. Charbit, P.: Circuits in graphs and digraphs via embeddings. Doctoral dissertation, University of Lyon I (2005)
4. Chen, X., Deng, X.: Settling the complexity of two-player nash equilibrium. In: FOCS (2006)
5. Chen, X., Deng, X., Teng, S.-H.: Computing nash equilibria:approximation and smoothed complexity. In: ECCC (2006)
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献