Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

66

AAAI
2007

favoriteEmaildiscussreport

105views Intelligent Agents» more AAAI 2007»

Computing Pure Nash Equilibria in Symmetric Action Graph Games

15 years 10 hour ago

Computing Pure Nash Equilibria in Symmetric Action Graph Games

Download people.cs.ubc.ca

Albert Xin Jiang, Kevin Leyton-Brown

Real-time Traffic

AAAI 2007 | Intelligent Agents |

claim paper

Related Content

» Computing pure strategy nash equilibria in compact symmetric games

» Computing Nash Equilibria of ActionGraph Games

» Symmetries and the Complexity of Pure Nash Equilibrium

» Constraint satisfaction algorithms for graphical games

» Pure Nash equilibria complete characterization of hard and easy graphical games

» The Impact of Network Topology on Pure Nash Equilibria in Graphical Games

» Symmetry in Network Congestion Games Pure Equilibria and Anarchy Cost

» On the Complexity of Nash Equilibria of ActionGraph Games

» Network Game with Attacker and Protector Entities

Post Info
More Details (n/a)

Added	02 Oct 2010
Updated	02 Oct 2010
Type	Conference
Year	2007
Where	AAAI
Authors	Albert Xin Jiang, Kevin Leyton-Brown

Comments (0)