[mormegil]

You are explaining how current algorithms try to find the (approximate) Nash equilibrium (and those algorithms are far from perfect; as noted in the recent DeepStack paper, current abstraction-based programs are beatable by over 3000 mbb/g, which is four times as large as simply folding each game). But my point is that even the (exact) equilibrium strategy would not necessarily be the best strategy against given non-equilibrium-playing players.

[andrewprock]

Yes, you are correct on every point. Opponent modeling and exploitation is significantly more difficult than coming up with a Nash equilibrium to an abstract game.