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
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
Approximating nash equilibria using small-support strategies
Proceedings of the 8th ACM conference on Electronic commerce
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The Search for Equilibrium Concepts
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
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)
Model checking nash equilibria in MAD distributed systems
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
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
Approximate Pure Nash Equilibria via Lovász Local Lemma
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
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
Gradient-based algorithms for finding Nash equilibria in extensive form games
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
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
On nash-equilibria of approximation-stable games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
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
Inapproximability of NP-complete variants of nash equilibrium
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
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
Parameterized two-player nash equilibrium
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
On mutual concavity and strategically-zero-sum bimatrix games
Theoretical Computer Science
The complexity of approximate nash equilibrium in congestion games with negative delays
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Recent development in computational complexity characterization of Nash equilibrium
Computer Science Review
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
Survey: Nash equilibria: Complexity, symmetries, and approximation
Computer Science Review
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
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Approximate well-supported nash equilibria below two-thirds
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 |
It is known [5] that an additively ε-approximate Nash equilibrium (with supports of size at most two) can be computed in polynomial time in any 2-player game with ε=.5. It is also known that no approximation better than .5 is possible unless equilibria with support larger than logn are considered, where n is the number of strategies per player. We give a polynomial algorithm for computing an ε-approximate Nash equilibrium in 2-player games with ε ≈ .38; our algorithm computes equilibria with arbitrarily large supports.