Sciweavers

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

65

Voted

TARK
2007
Springer

favoriteEmaildiscussreport

79views Automated Reasoning» more TARK 2007»

Games, geometry, and the computational complexity of finding equilibria

15 years 5 months ago

Games, geometry, and the computational complexity of finding equilibria

Download www.maths.lse.ac.uk

Bernhard von Stengel

Real-time Traffic

TARK 2007 |

claim paper

Related Content

» Finding equilibria in large sequential games of imperfect information

» The complexity of uniform Nash equilibria and related regular subgraph problems

» The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games

» Optimality and Complexity of Pure Nash Equilibria in the Coverage Game

» How Incomputable is Finding Nash Equilibria

» Equilibria Fixed Points and Complexity Classes

» On the Complexity of Equilibria Problems in AngelDaemon Games

» Decision Problems for Nash Equilibria in Stochastic Games

» GradientBased Algorithms for Finding Nash Equilibria in Extensive Form Games

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	TARK
Authors	Bernhard von Stengel

Comments (0)