Acceptable costs of minimax regret equilibrium: A Solution to security games with surveillance-driven probabilistic information.

•We extend the application of security game to online security resource allocation.•A regret and loss aversion based method for online security game is given.•An epistemic characterization is given for the justification of the new method.•We show the linear programming formulation and robustness analysis of the method.•The viability of the method is demonstrated with an experimental evaluation.