Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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 algorithms for solving graphical games
Eighteenth national conference on Artificial 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
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
Complexity of (iterated) dominance
Proceedings of the 6th ACM conference on Electronic commerce
Computing the optimal strategy to commit to
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
Lossless abstraction of imperfect information games
Journal of the ACM (JACM)
Factoring games to isolate strategic interactions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Compact preference representation and Boolean games
Autonomous Agents and Multi-Agent Systems
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
Dependencies between players in Boolean games
International Journal of Approximate Reasoning
Computational analysis of perfect-information position auctions
Proceedings of the 10th ACM conference on Electronic commerce
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science
A polynomial-time algorithm for action-graph games
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Fast and compact: a simple class of congestion games
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Computing pure Nash equilibria in symmetric action graph games
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A continuation method for Nash equilibria in structured games
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation
Theoretical Computer Science
Temporal action-graph games: a new representation for dynamic games
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Computing pure strategy nash equilibria in compact symmetric games
Proceedings of the 11th ACM conference on Electronic commerce
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
Polynomial-time computation of exact correlated equilibrium in compact games
Proceedings of the 12th ACM conference on Electronic commerce
Decentralized MDPs with sparse interactions
Artificial Intelligence
A general framework for computing optimal correlated equilibria in compact games
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Computing nash equilibria of action-graph games via support enumeration
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
| Hi-index | 0.00 |
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functions. Actions are represented as nodes in a graph G, and the payoff to an agent who chose the action s depends only on the numbers of other agents who chose actions connected to s. We present algorithms for computing both symmetric and arbitrary equilibria of AGGs using a continuation method. We analyze the worst-case cost of computing the Jacobian of the payoff function, the exponential-time bottleneck step, and in all cases achieve exponential speedup. When the in-degree of G is bounded by a constant and the game is symmetric, the Jacobian can be computed in polynomial time.