Sciweavers

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

101

Voted

SIGECOM
2003
ACM

154views ECommerce» more SIGECOM 2003»

A polynomial-time nash equilibrium algorithm for repeated games

15 years 8 months ago

A polynomial-time nash equilibrium algorithm for repeated games

Download www.cs.rutgers.edu

Michael L. Littman, Peter Stone

Real-time Traffic

SIGECOM 2003 |

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 Stochastic Games

» On the Equilibria of Alternating Move Games

» Nearoptimal network design with selfish agents

» Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games

» Computing Equilibria in Anonymous Games

» Small Clique Detection and Approximate Nash Equilibria

» Approximating pure nash equilibrium in cut party affiliation and satisfiability games

Post Info
More Details (n/a)

Added	05 Jul 2010
Updated	05 Jul 2010
Type	Conference
Year	2003
Where	SIGECOM
Authors	Michael L. Littman, Peter Stone

Comments (0)