Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
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
Approximating nash equilibria using small-support strategies
Proceedings of the 8th ACM conference on Electronic commerce
Progress in approximate nash equilibria
Proceedings of the 8th ACM conference on Electronic commerce
An optimization approach for approximate Nash equilibria
WINE'07 Proceedings of the 3rd 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
Efficient algorithms for constant well supported approximate equilibria in bimatrix games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Approximate Equilibria for Strategic Two Person Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Approximate Nash Equilibria for Multi-player Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
How hard is it to approximate the best Nash equilibrium?
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An Efficient PTAS for Two-Strategy Anonymous Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Performance Evaluation of a Descent Algorithm for Bi-matrix Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
Polynomial algorithms for approximating Nash equilibria of bimatrix games
Theoretical Computer Science
A note on approximate Nash equilibria
Theoretical Computer Science
On oblivious PTAS's for nash equilibrium
Proceedings of the forty-first annual ACM symposium on Theory of computing
New algorithms for approximate Nash equilibria in bimatrix games
Theoretical Computer Science
An optimization approach for approximate Nash equilibria
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Approximation guarantees for fictitious play
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On the equilibria of alternating move games
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Computing exact and approximate Nash equilibria in 2-player games
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
The cooperative game theory foundations of network bargaining games
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Computational game theory: an introduction
Algorithms and theory of computation handbook
Exploiting concavity in bimatrix games: new polynomially tractable subclasses
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A direct reduction from k-player to 2-player approximate nash equilibrium
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Approximability of symmetric bimatrix games and related experiments
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
On the approximation performance of fictitious play in finite games
ESA'11 Proceedings of the 19th European conference on Algorithms
How Hard Is It to Approximate the Best Nash Equilibrium?
SIAM Journal on Computing
On the complexity of approximating a Nash equilibrium
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On mutual concavity and strategically-zero-sum bimatrix games
Theoretical Computer Science
Survey: Nash equilibria: Complexity, symmetries, and approximation
Computer Science Review
On the communication complexity of approximate nash equilibria
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
On the Complexity of Approximating a Nash Equilibrium
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
| Hi-index | 0.00 |
We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves an approximation guarantee of 0.36392. Our work improves the previously best known (0.38197 + Ɛ)-approximation algorithm of Daskalakis, Mehta and Papadimitriou [6]. First, we provide a simpler algorithm, which also achieves 0.38197. This algorithm is then tuned, improving the approximation error to 0.36392. Our method is relatively fast, as it requires solving only one linear program and it is based on using the solution of an auxiliary zerosum game as a starting point.