Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Nonserial Dynamic Programming
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in 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
Correlated equilibria in graphical games
Proceedings of the 4th ACM conference on Electronic commerce
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Computing approximate bayes-nash equilibria in tree-games of incomplete information
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Computing Nash equilibria of action-graph games
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Perspectives on multiagent learning
Artificial Intelligence
Computing good nash equilibria in graphical games
Proceedings of the 8th ACM conference on Electronic commerce
Constraint satisfaction algorithms for graphical games
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Self-interested database managers playing the view maintenance game
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science
Supporting Negotiations over Influence Diagrams
Decision Analysis
On the reasoning patterns of agents in games
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
An interaction-based approach to computational epidemiology
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
A continuation method for Nash equilibria in structured games
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Complexity of pure equilibria in Bayesian games
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A continuation method for Nash equilibria in structured games
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A sampling-based approach to computing equilibria in succinct extensive-form games
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Journal of Intelligent and Robotic Systems
An approach for multi-objective categorization based on the game theory and Markov process
Applied Soft Computing
Distributed cooperation in wireless sensor networks
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Efficient nash computation in large population games with bounded influence
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Computing equilibria using interval constraints
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
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
Graph formation effects on social welfare and inequality in a networked resource game
SBP'13 Proceedings of the 6th international conference on Social Computing, Behavioral-Cultural Modeling and Prediction
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
Protecting privacy through distributed computation in multi-agent decision making
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Consider the problem of a group of agents trying to find a stable strategy profile for a joint interaction. A standard approach is to describe the situation as a single multiplayer game and find an equilibrium strategy profile of that game. However, most algorithms for finding equilibria are computationally expensive; they are also centralized, requiring that all relevant payoff information be available to a single agent (or computer) who must determine the entire equilibrium profile. In this paper, we exploit two ideas to address these problems. We consider structured game representations, where the interaction between the agents is sparse, an assumption that holds in many real-world situations. We also consider the slightly relaxed task of finding an approximate equilibrium. We present two algorithms for finding approximate equilibria in these games, one based on a hill-climbing approach and one on constraint satisfaction. We show that these algorithms exploit the game structure to achieve faster computation. They are also inherently local, requiring only limited communication between directly interacting agents. They can thus be scaled to games involving large numbers of agents, provided the interaction between the agents is not too dense.