Sciweavers

54 search results - page 4 / 11
» Correlated equilibria in graphical games
Sort
View
ATAL
2010
Springer
14 years 1 hour ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
IJCAI
2003
14 years 7 days ago
A Continuation Method for Nash Equilibria in Structured Games
We describe algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorithms...
Ben Blum, Christian R. Shelton, Daphne Koller
ATAL
2011
Springer
12 years 11 months ago
Maximum causal entropy correlated equilibria for Markov games
Motivated by a machine learning perspective—that gametheoretic equilibria constraints should serve as guidelines for predicting agents’ strategies, we introduce maximum causal...
Brian D. Ziebart, J. Andrew Bagnell, Anind K. Dey
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
AAAI
2007
14 years 1 months ago
The Impact of Network Topology on Pure Nash Equilibria in Graphical Games
Graphical games capture some of the key aspects relevant to the study and design of multi-agent systems. It is often of interest to find the conditions under which a game is stab...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...