loading...
Nash Equilibria in Random Games
Pittsburgh, Pennsylvania, USA October 23-October 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.2005.5246th Annual IEEE Symposium on Foundat ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Imre Barany, Imre Barany
Adrian Vetta, Adrian Vetta

We consider Nash equilibria in 2-player random games and analyze a simple Las Vegas algorithm for finding an equilibrium. The algorithm is combinatorial and always finds a Nash equilibrium; on m x n payoff matrices,it runs in time O(a^2 n\log \log n + n^2 m\log \log n) with high probability. Our main tool is a polytope formulation of equilibria.

Citation:
Imre Barany, Santosh Vempala, Adrian Vetta, "Nash Equilibria in Random Games," focs, pp.123-131, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.