Sciweavers

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

94

Voted

STOC
2006
ACM

130views Algorithms» more STOC 2006»

The complexity of computing a Nash equilibrium

16 years 3 months ago

The complexity of computing a Nash equilibrium

Download www.cs.berkeley.edu

Constantinos Daskalakis, Paul W. Goldberg, Christo

Real-time Traffic

Algorithms | Nash Equilibrium | STOC 2006 |

claim paper

Related Content

» Recent development in computational complexity characterization of Nash equilibrium

» Settling the Complexity of Computing TwoPlayer Nash Equilibria

» Hardness of Pure Nash Equilibrium in Scheduling and Connection Games

» Symmetries and the Complexity of Pure Nash Equilibrium

» The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games

» Computing Nash Equilibria Approximation and Smoothed Complexity

» The computational complexity of nash equilibria in concisely represented games

» Dynamic spectrum management with the competitive market model

» Algorithms for Rationalizability and CURB Sets

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2006
Where	STOC
Authors	Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou

Comments (0)