Sciweavers

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

20

UAI
2008

favoriteEmaildiscussreport

183views Artificial Intelligence» more UAI 2008»

A Polynomial-time Nash Equilibrium Algorithm for Repeated Stochastic Games

14 years 17 days ago

A Polynomial-time Nash Equilibrium Algorithm for Repeated Stochastic Games

Download uai2008.cs.helsinki.fi

Enrique Munoz de Cote, Michael L. Littman

Real-time Traffic

Artificial Intelligence | UAI 2008 |

claim paper

Related Content

» Learning NearParetoOptimal Conventions in Polynomial Time

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

» A polynomialtime nash equilibrium algorithm for repeated games

» On the Equilibria of Alternating Move Games

» Nearoptimal network design with selfish agents

» Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games

» Multiagent reinforcement learning algorithm converging to Nash equilibrium in generalsum d...

» Computing Equilibria in Anonymous Games

» Small Clique Detection and Approximate Nash Equilibria

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	UAI
Authors	Enrique Munoz de Cote, Michael L. Littman

Comments (0)