The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Computing good nash equilibria in graphical games
Proceedings of the 8th ACM conference on Electronic commerce
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
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Lossless abstraction of imperfect information games
Journal of the ACM (JACM)
The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fast algorithms for finding proper strategies in game trees
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A joint selfish routing and channel assignment game in wireless mesh networks
Computer Communications
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Regret minimization and the price of total anarchy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computer science and game theory
Communications of the ACM - Designing games with a purpose
Computing correlated equilibria in multi-player games
Journal of the ACM (JACM)
The complexity of uniform Nash equilibria and related regular subgraph problems
Theoretical Computer Science
Altruism, selfishness, and spite in traffic routing
Proceedings of the 9th ACM conference on Electronic commerce
Fast convergence to nearly optimal solutions in potential games
Proceedings of the 9th ACM conference on Electronic commerce
Computing an approximate jam/fold equilibrium for 3-player no-limit Texas Hold'em tournaments
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Evolutionary dynamics for designing multi-period auctions
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
On Satisfiability Games and the Power of Congestion Games
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Complexity of Verifying Game Equilibria
CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
The computation of approximate competitive equilibrium is PPAD-hard
Information Processing Letters
Note: On the complexity of deciding bimatrix games similarity
Theoretical Computer Science
The complexity of equilibria: Hardness results for economies via a correspondence with games
Theoretical Computer Science
The complexity of computing a Nash equilibrium
Communications of the ACM - Inspiring Women in Computing
Artificial Intelligence
Approximate Equilibria for Strategic Two Person Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Strategic Characterization of the Index of an Equilibrium
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
The Local and Global Price of Anarchy of Graphical 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
On the Hardness and Existence of Quasi-Strict Equilibria
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
The Price of Stochastic Anarchy
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
On the complexity of Nash equilibria of action-graph games
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Symmetries and the complexity of pure Nash equilibrium
Journal of Computer and System Sciences
An Efficient PTAS for Two-Strategy Anonymous Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Equilibrium Points in Fear of Correlated Threats
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
Algorithms for Solving Infinite Games
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
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
Computational aspects of Shapley's saddles
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
On the complexity of nash dynamics and sink equilibria
Proceedings of the 10th ACM conference on Electronic commerce
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Theoretical Computer Science
Algorithmic Game Theory: A Snapshot
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Load balancing without regret in the bulletin board model
Proceedings of the 28th ACM symposium on Principles of distributed computing
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science
Computing pure Nash equilibria in symmetric action graph games
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Efficiently exploiting symmetries in real time dynamic programming
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Complexity of pure equilibria in Bayesian games
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
New algorithms for approximate Nash equilibria in bimatrix games
Theoretical Computer Science
Computing equilibria in multiplayer stochastic games of imperfect information
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
The Computational Complexity of Weak Saddles
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Learning and Approximating the Optimal Strategy to Commit To
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximate Pure Nash Equilibria via Lovász Local Lemma
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Direction Preserving Zero Point Computing and Applications
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On the approximation and smoothed complexity of Leontief market equilibria
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Algorithms for playing games with limited randomness
ESA'07 Proceedings of the 15th annual European conference on Algorithms
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
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
Extending polynomial time computability to markets with demand correspondences
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
A PSPACE-complete Sperner triangle game
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
The complexity of Nash equilibria in infinite multiplayer games
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Approximation guarantees for fictitious play
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Computing pure strategy nash equilibria in compact symmetric games
Proceedings of the 11th ACM conference on Electronic commerce
Computing optimal strategies to commit to in extensive-form games
Proceedings of the 11th ACM conference on Electronic commerce
Decision problems for Nash equilibria in stochastic games
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
A noncooperative spectrum sensing game with maximum network throughput
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Computing equilibria by incorporating qualitative models?
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
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
Algorithms for closed under rational behavior (CURB) sets
Journal of Artificial Intelligence Research
When the players are not expectation maximizers
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
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
The computational complexity of trembling hand perfection and other equilibrium refinements
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Local dynamics in bargaining networks via random-turn games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
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
Local and global price of anarchy of graphical games
Theoretical Computer Science
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
An expressive mechanism for auctions on the web
Proceedings of the 20th international conference on World wide web
Security applications: lessons of real-world deployment
ACM SIGecom Exchanges
Repeated matching pennies with limited randomness
Proceedings of the 12th ACM conference on Electronic commerce
Polynomial-time computation of exact correlated equilibrium in compact games
Proceedings of the 12th ACM conference on Electronic commerce
Distributed algorithms via gradient descent for fisher markets
Proceedings of the 12th ACM conference on Electronic commerce
On optimal single-item auctions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
Approximability of symmetric bimatrix games and related experiments
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Solving Stackelberg games with uncertain observability
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
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
Discrete Fixed Points: Models, Complexities, and Applications
Mathematics of Operations Research
Convergence method, properties and computational complexity for Lyapunov games
International Journal of Applied Mathematics and Computer Science - SPECIAL SECTION: Efficient Resource Management for Grid-Enabled Applications
On the complexity of pure-strategy nash equilibria in congestion and local-effect games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Making economic theory operational
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Market equilibria with hybrid linear-leontief utilities
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
Game theoretic design for polarimetric MIMO radar target detection
Signal Processing
On minmax theorems for multiplayer games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
Approximation algorithm for security games with costly resources
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
A general framework for computing optimal correlated equilibria in compact games
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
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
Bilinear games: polynomial time algorithms for rank based subclasses
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
The Computational Complexity of Nash Equilibria in Concisely Represented Games
ACM Transactions on Computation Theory (TOCT)
Bayesian optimal auctions via multi- to single-agent reduction
Proceedings of the 13th ACM Conference on Electronic Commerce
Computing a proper equilibrium of a bimatrix game
Proceedings of the 13th ACM Conference on Electronic Commerce
Security games with multiple attacker resources
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
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
Probabilistic techniques in algorithmic game theory
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Efficient algorithms for constant well supported approximate equilibria in bimatrix games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Finding equilibria in games of no chance
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
On the communication complexity of approximate nash equilibria
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Note: On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix
Theoretical Computer Science
New differential evolution selective mutation operator for the nash equilibria problem
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
Using representative strategies for finding nash equilibria
Proceedings of the 15th annual conference on Genetic and evolutionary computation
On the Complexity of Approximating a Nash Equilibrium
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
PREVE: a policy recommendation engine based on vector equilibria applied to reducing LeT's attacks
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Differential evolution as a new method of computing nash equilibria
Transactions on Computational Collective Intelligence IX
The truth behind the myth of the folk theorem
Proceedings of the 5th conference on Innovations in theoretical computer science
ACM Transactions on Algorithms (TALG)
Decentralized anti-coordination through multi-agent learning
Journal of Artificial Intelligence Research
Multiagent learning in the presence of memory-bounded agents
Autonomous Agents and Multi-Agent Systems
Exponentiality of the exchange algorithm for finding another room-partitioning
Discrete Applied Mathematics
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)
Theory of Computing Systems
| Hi-index | 0.01 |
We prove that the problem of finding a Nash equilibrium in a two-player game is PPAD-complete.