Algorithms for Nash equilibrium computation. I searched the forum to see if this has been asked before, and while algorithmic game theory is discussed, I couldn't find this particular issue addressed.  I am trying to figure out what the best known algorithm is for computing approximate (mixed-strategy) Nash equilibria in a finite n-person game.  Of course, this algorithm would be PPAD.  I am more interested in speed/efficiency than perfect accuracy of the algorithm.

Thanks,
Philip
Perhaps the 2008 paper presented at the Symposium on Algorithmic Game Theory
by Hémon, Rougemont, and Santha, "Approximate Nash Equilibria for Multi-player Games" could help?
They "exhibit polynomial-time algorithms for additive approximation" for $n$-player games.