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
Correlated equilibria in graphical games
Proceedings of the 4th ACM conference on Electronic commerce
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
Computing best-response strategies in infinite games of incomplete information
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Lossless abstraction of imperfect information games
Journal of the ACM (JACM)
Constraint satisfaction algorithms for graphical games
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Approximate and online multi-issue negotiation
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
An efficient heuristic approach for security against multiple adversaries
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
Exploiting locality of interaction in factored Dec-POMDPs
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Complexity of pure equilibria in Bayesian games
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Computing equilibria by incorporating qualitative models?
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types
Artificial Intelligence
Protecting privacy through distributed computation in multi-agent decision making
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We provide efficient algorithms for finding approximate Bayes-Nash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent's payoff depends on its private type as well as on the actions of the agents in its local neighborhood in the graph. We consider two classes of such games: (1) arbitrary tree-games with discrete types, and (2) tree-games with continuous types but with constraints on the effect of type on payoffs. For each class we present a message passing on the game-tree algorithm that computes an ε-BNE in time polynomial in the number of agents and the approximation parameter 1\ε.