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.