Active Bibliography

7 Computing equilibria: A computational complexity perspective – Tim Roughgarden - 2009
5 An algorithmic game theory primer – Tim Roughgarden - 2008
63 Pure Nash Equilibria: Hard and Easy Games – Georg Gottlob, Gianluigi Greco, Francesco Scarcello
Representing and Reasoning with Large Games by – Xin Jiang - 2011
39 On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract) – Kousha Etessami, Mihalis Yannakakis - 2007
7 Efficient algorithms for constant well supported approximate equilibria in bimatrix games – Equilibria In Bimatrix Games, Spyros C. Kontogiannis, Spyros C. Kontogiannis, Paul G. Spirakis, Paul G. Spirakis - 2007
Cost Sharing and Clustering . . . – Martin Hoefer - 2007
46 Settling the Complexity of Computing Two-Player Nash Equilibria – Xi Chen, Xiaotie Deng, Shang-hua Teng
8 The approximation complexity of win-lose games – Xi Chen, Shang-hua Teng - 2007
7 The np-completeness column: Finding needles in haystacks – David S. Johnson - 2007
14 A generalized strategy eliminability criterion and computational methods for applying it – Vincent Conitzer, Tuomas Sandholm - 2005
66 Computing Nash equilibria: Approximation and smoothed complexity – Xi Chen, Xiaotie Deng, Shang-hua Teng - 2006
46 Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game – Rahul Savani, Bernhard von Stengel - 2004
4 Complexity of pure equilibria in Bayesian games – Georg Gottlob, Gianluigi Greco, Toni Mancini - 2007
4 Well supported approximate equilibria in bimatrix games: A graph theoretic approach – Spyros C. Kontogiannis, Paul G. Spirakis - 2007
2 Algorithms for abstracting and solving imperfect information games – Andrew Gilpin - 2007
106 Settling the complexity of two-player Nash equilibrium – Xi Chen, Xiaotie Deng - 2006
Permanent Member – Michael L. Littman, Nishkam Ravi, Arjun Talwar, Martin Zinkevich - 2006
20 Symmetries and the Complexity of Pure Nash Equilibrium – Felix Brandt , Felix Fischer , Markus Holzer - 2006