By Topic

Nash equilibria in random games

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Barany, I. ; R ''enyi Inst. of Math., Hungarian Acad. of Sci., Hungary ; Vempala, S. ; Vetta, A.

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 × n payoff matrices, it runs in time O(m2n log log n + n2m log log m) with high probability. Our main tool is a polytope formulation of equilibria.

Published in:

Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on

Date of Conference:

23-25 Oct. 2005