Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
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
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Journal of the ACM (JACM)
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
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Reasoning about Rationality and Beliefs
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Theory of Relational Databases
Theory of Relational Databases
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Non-binary constraints and optimal dual-graph representations
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Complexity of determining nonemptiness of the core
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Multi-agent influence diagrams for representing and solving games
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Efficient nash computation in large population games with bounded influence
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
Information Processing Letters
Realising Common Knowledge Assumptions in Agent Auctions
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Applying game theory mechanisms in open agent systems with complete information
Autonomous Agents and Multi-Agent Systems
On the Complexity of Equilibria Problems in Angel-Daemon Games
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Comparing the notions of optimality in CP-nets, strategic games and soft constraints
Annals of Mathematics and Artificial Intelligence
Dependencies Between Players in Boolean Games
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
On the Hardness and Existence of Quasi-Strict Equilibria
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games
Recent Advances in Constraints
Compact preference representation and Boolean games
Autonomous Agents and Multi-Agent Systems
Equilibria of Graphical Games with Symmetries
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Dependencies between players in Boolean games
International Journal of Approximate Reasoning
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science
On strictly competitive multi-player games
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Answer Sets in a Fuzzy Equilibrium Logic
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Computing pure strategy nash equilibria in compact symmetric games
Proceedings of the 11th ACM conference on Electronic commerce
Graphical representation of ordinal preferences: languages and applications
ICCS'10 Proceedings of the 18th international conference on Conceptual structures: from information to intelligence
On the complexity of pareto-optimal nash and strong equilibria
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Equilibria of graphical games with symmetries
Theoretical Computer Science
Equilibria problems on games: Complexity versus succinctness
Journal of Computer and System Sciences
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
Rational Generating Functions and Integer Programming Games
Operations Research
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Manipulating boolean games through communication
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Towards tractable Boolean games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Fuzzy Equilibrium Logic: Declarative Problem Solving in Continuous Domains
ACM Transactions on Computational Logic (TOCL)
Bilateral bargaining with one-sided uncertain reserve prices
Autonomous Agents and Multi-Agent Systems
On discrete preferences and coordination
Proceedings of the fourteenth ACM conference on Electronic commerce
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games
Theory of Computing Systems
Hi-index | 0.00 |
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 Σ2P-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 payoff 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 G can be expressed by a graph G(G) or by a hypergraph H(G). By relating Nash equilibrium problems to constraint satisfaction problems (CSPs), we show that if G has small neighborhood and if H(G) has bounded hypertree width (or if G(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.