Exploiting exploration strategies in repeated normal form security games

We describe a method for the estimation of an opponent's utility matrix in a finite repeated game, given that he selects his actions by a known deterministic algorithm with some unknown parameters. We also investigate the prediction, based on the utility matrix estimate, of this opponent's future actions, and a simple method by which the opponent can counter these efforts. These are posed as a feasibility problem and a convex optimization problem, respectively. Simulation results are also presented.