Berkeley AI Course Question on Nearly Zero Sum Games
(using X for epsilon because keyboard)

This is just a hypothesis, but if you have a maximising agent and a minimising agent, then the optimal outcome for A (maximising) is to sweep the board (X,0), while the optimal outcome for B (minimising) is (-X,0) because B is minimising A's score, not their own. 

A's optimal outcome is then complicated by the factor for sub-optimality, which we then imagine approaches zero.

There seem to be a bunch of assumptions that are not articulated, though, if this hypothesis is true.