Nash equilibria in random games
- Already Purchased? View Article
- Subscription Options Learn More
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