Sciweavers

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

42

Voted

AAAI
2006

favoriteEmaildiscussreport

78views Intelligent Agents» more AAAI 2006»

A Polynomial-Time Algorithm for Action Graph Games

15 years 28 days ago

A Polynomial-Time Algorithm for Action Graph Games

Download www.aaai.org

Albert Xin Jiang, Kevin Leyton-Brown

Real-time Traffic

AAAI 2006 | Intelligent Agents |

claim paper

Related Content

» A Polynomial Time Algorithm for Finding Nash Equilibria in Planar WinLose Games

» Computing Nash Equilibria of ActionGraph Games

» RMAX A General Polynomial Time Algorithm for NearOptimal Reinforcement Learning

» Learning NearParetoOptimal Conventions in Polynomial Time

» On the Complexity of Nash Equilibria of ActionGraph Games

» An Algorithmic Analysis of the HoneyBee Game

» Small Clique Detection and Approximate Nash Equilibria

» Spectral Algorithms for Unique Games

» Nash equilibria in graphical games on trees revisited

Post Info
More Details (n/a)

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

Comments (0)