Playing repeated security games with multiple attacker types:a Q-iteration on a linear programming approach  

作　　者：Ling Chen Mingchu Li Yingmo Jie 

机构地区：[1]School of Mathematical Science,Dalian University of Technology,Dalian,People’s Republic of China [2]School of Software Technology,Dalian University of Technology,Dalian,People’s Republic of China

出　　处：《Journal of Control and Decision》2021年第3期322-330,共9页控制与决策学报（英文）

基　　金：The paper is supported by theNationalNatural Science Foundation of China[grant nos 61572095,61877007].

摘　　要：This paper investigates infinite horizon repeated security games with one defender and multiple attacker types.The incomplete information brings uncertainty of attackers’behaviour for the defender.Under the uncertainty of attackers’behaviours,we take the worst-case analysis to minimise the defender’s regret w.r.t.each attacker type.We wish to keep the regret especially small w.r.t.one attacker type,at the cost of modest additional overhead compared to others.The tradeoff among the objectives requires us to build a Multi-Objective Repeated SecurityGame(MORSG)model.To parameterise the regret Pareto frontier,we combine the different weight vectors with different objectives and build a linear programming approach.By running the Q-iteration procedure on linear programming for each weight vector,the optimal regret Pareto frontier can be computed.We also propose an approximate approach to approximate it.The approximation analysis proves the effectiveness of the approximation approach.

关 键 词：Multi-objective repeated security game(MORSG) Q-iteration regret Pareto frontier 

分 类 号：O17[理学—数学]