Sciweavers

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

8

MOR
2010

favoriteEmaildiscussreport

106views more MOR 2010»

Smoothing Techniques for Computing Nash Equilibria of Sequential Games

13 years 3 months ago

Smoothing Techniques for Computing Nash Equilibria of Sequential Games

Download www.cs.cmu.edu

We develop ﬁrst-order smoothing techniques for saddle-point problems that arise in the Nash equilibria computation of sequential games. The crux of our work is a construction of suitable prox-functions for a certain class of polytopes that encode the sequential nature of the games. An implementation based on our smoothing techniques computes approximate Nash equilibria for games that are four orders of magnitude larger than what conventional computational approaches can handle.

Samid Hoda, Andrew Gilpin, Javier Peña, Tuo

Real-time Traffic

MOR 2010 | Nash Equilibria | Nash Equilibria Computation | Smoothing Techniques |

claim paper

Related Content

» GradientBased Algorithms for Finding Nash Equilibria in Extensive Form Games

» Finding equilibria in large sequential games of imperfect information

» Computing Nash Equilibria Approximation and Smoothed Complexity

» Hardness of Pure Nash Equilibrium in Scheduling and Connection Games

» A constructive approach to sequential Nash equilibria

» Homotopy Methods to Compute Equilibria in Game Theory

» Approximating mixed Nash equilibria using smooth fictitious play in simultaneous auctions

» Computing pure nash equilibria in graphical games via markov random fields

» A technique for reducing normalform games to compute a Nash equilibrium

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	MOR
Authors	Samid Hoda, Andrew Gilpin, Javier Peña, Tuomas Sandholm

Comments (0)