Game Theory, Artificial Intelligence.
strongest opponent exploitation algorithms assume that approximations of Nash equilibrium strategies have already been created as a subroutine). As one example, I created an algorithm for opponent modeling in large imperfect-information games I showed significantly outperformed an approximate Nash