Acceptable costs of minimax regret equilibrium: A Solution to security games with surveillance-driven probabilistic information
作者：
Highlights：
• 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.
摘要
•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.
论文关键词：Security game,Real-time resource allocation,Minimax regret,Loss aversion,Intelligence surveillance system,Decision support
论文评审过程：Received 20 July 2017, Revised 13 March 2018, Accepted 31 March 2018, Available online 26 April 2018, Version of Record 19 May 2018.
论文官网地址：https://doi.org/10.1016/j.eswa.2018.03.066
