If a game has a Nash equilibrium with probability values that are either zero
or Omega(1) then this equilibrium can be found exhaustively in polynomial time.
Somewhat surprisingly, we show that there is a PTAS for the games whose
equilibria are guaranteed to have small-O(1/n)-values, and therefore
large-Omega(n)-supports.