Two applications of inductive counting for complementation problems
SIAM Journal on Computing
On total functions, existence theorems and computational complexity
Theoretical Computer Science
Properties that characterize LOGCFL
Journal of Computer and System Sciences
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
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
On complexity as bounded rationality (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A comparison of structural CSP decomposition methods
Artificial Intelligence
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
On the complexity of equilibria
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Multi-agent algorithms for solving graphical games
Eighteenth national conference on Artificial intelligence
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Efficient nash computation in large population games with bounded influence
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Reducibility among equilibrium problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Computing pure nash equilibria in graphical games via markov random fields
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
The computational complexity of nash equilibria in concisely represented games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
A technique for reducing normal-form games to compute a Nash equilibrium
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Solving abduction by computing joint explanations
Annals of Mathematics and Artificial Intelligence
The complexity of uniform Nash equilibria and related regular subgraph problems
Theoretical Computer Science
On domination game analysis for microeconomic data mining
ACM Transactions on Knowledge Discovery from Data (TKDD)
The Network Game: Analyzing Network-Formation and Interaction Strategies in Tandem
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Varying Domain Representations in Hagl
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
A generalized strategy eliminability criterion and computational methods for applying it
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
The impact of network topology on pure Nash equilibria in graphical games
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Computing pure Nash equilibria in symmetric action graph games
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Complexity of pure equilibria in Bayesian games
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Pure Nash equilibria: complete characterization of hard and easy graphical games
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A simple graph-theoretic model for selfish restricted scheduling
WINE'05 Proceedings of the First international conference on Internet and Network Economics
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Pure nash equilibria in games with a large number of actions
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Computing nash equilibria of action-graph games via support enumeration
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)
Verifying normative behaviour via normative mechanism design
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Finding pure nash equilibrium of graphical game via constraints satisfaction approach
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A study on the stability and efficiency of graphical games with unbounded treewidth
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hi-index | 0.00 |
In this paper we investigate complexity issues related to pure Nash equilibria of strategic games. We show that, even in very restrictive settings, determining whether a game has a pure Nash Equilibrium is NP-hard, while deciding whether a game has a strong Nash equilibrium is ΣP2-complete. We then study practically relevant restrictions that lower the complexity. In particular, we are interested in quantitative and qualitative restrictions of the way each player's move depends on moves of other players. We say that a game has small neighborhood if the utility function for each player depends only on (the actions of) a logarithmically small number of other players, The dependency structure of a game 𝒢 can he expressed by a graph G(𝒢) or by a hypergraph H(𝒢). Among other results, we show that if 𝒢 has small neighborhood and if H(𝒢) has bounded hypertree width (or if G(𝒢) has bounded treewidth), then finding pure Nash and Pareto equilibria is feasible in polynomial time. If the game is graphical, then these problems are LOGCFL-complete and thus in the class NC2 of highly parallelizable problems.