Computing Robust Counter-Strategies ­ M2
Michael Johanson, Martin Zinkevich, Michael Bowling

Possible Strategies for Competitive Scenarios:  Nash Equilibrium:
Robust against arbitrary opponents Does not exploit any opponent  Best Response: Maximally exploits one opponent Loses badly to other opponents A Compromise:  Restricted Nash Response: Exploits a specific opponent Robust against arbitrary opponents

 Can choose the tradeoff between exploitation and robustness  Demonstrated in Texas Hold'em Poker