Mathematics of Operations Research
On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
On the Complexity of Two-PlayerWin-Lose Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Nash Equilibria in Random Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Reducibility among equilibrium problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Computing Nash Equilibria: Approximation and Smoothed Complexity
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Progress in approximate nash equilibria
Proceedings of the 8th ACM conference on Electronic commerce
Mixed-integer programming methods for finding Nash equilibria
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
New algorithms for approximate Nash equilibria in bimatrix games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
An optimization approach for approximate Nash equilibria
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Polynomial algorithms for approximating nash equilibria of bimatrix games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
A note on approximate nash equilibria
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Well supported approximate equilibria in bimatrix games: a graph theoretic approach
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Efficient algorithms for constant well supported approximate equilibria in bimatrix games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Computational Aspects of Equilibria
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
How Hard Is It to Approximate the Best Nash Equilibrium?
SIAM Journal on Computing
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
| Hi-index | 0.00 |
In view of the apparent intractability of constructing Nash Equilibria (NE in short) in polynomial time, even for bimatrix games, understanding the limitations of the approximability of the problem is an important challenge. The purpose of this document is to review a set of results, which have contributed significantly, and currently are the state-of-art with respect to the polynomial time construction of approximate Nash equilibria in bimatrix games. Most of the results discussed here are joint work of the author and of the union of his coauthors in various papers, namely S. Kontogiannis, P. Panagopoulou and H. Tsaknakis.