Mathematics of Operations Research
The complexity of approximating a nonlinear program
Mathematical Programming: Series A and B
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
New algorithms for approximate Nash equilibria in bimatrix games
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
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
A FPTAS for Computing a Symmetric Leontief Competitive Economy Equilibrium
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
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
Small Clique Detection and Approximate Nash Equilibria
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
New algorithms for approximate Nash equilibria in bimatrix games
Theoretical Computer Science
New algorithms for approximate Nash equilibria in bimatrix 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
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
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
Practical and efficient approximations of nash equilibria for win-lose games based on graph spectra
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Approximability of symmetric bimatrix games and related experiments
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Approximate nash equilibria in bimatrix games
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
An interior-point path-following algorithm for computing a Leontief economy equilibrium
Computational Optimization and Applications
Random bimatrix games are asymptotically easy to solve (a simple proof)
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
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
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
Differential evolution as a new method of computing nash equilibria
Transactions on Computational Collective Intelligence IX
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)
Theory of Computing Systems
Hi-index | 0.00 |
In this paper we propose a new methodology for determining approximate Nash equilibria of non-cooperative bimatrix games and, based on that, we provide an efficient algorithm that computes 0.3393- approximate equilibria, the best approximation till now. The methodology is based on the formulation of an appropriate function of pairs of mixed strategies reflecting the maximum deviation of the players' payoffs from the best payoff each player could achieve given the strategy chosen by the other. We then seek to minimize such a function using descent procedures. As it is unlikely to be able to find global minima in polynomial time, given the recently proven intractability of the problem, we concentrate on the computation of stationary points and prove that they can be approximated arbitrarily close in polynomial time and that they have the above mentioned approximation property. Our result provides the best Ɛ till now for polynomially computable Ɛ-approximate Nash equilibria of bimatrix games. Furthermore, our methodology for computing approximate Nash equilibria has not been used by others.