报告人：张楠 副教授（华东师范大学）

时间：2024年11月15日 10:30-

地点: 数统学院LD402

摘要：In this paper, we study the budget allocation strategies that can enhance defence capabilities of all agents within a random communication network, and thereby mitigate potential losses resulting from cyber attacks. We adopt two models of undirected random network graph, i.e., the Erdös–Rényi model and the Barabási–Albert model, to depict the network topology. And the SIR model is used to simulate the propagation process of cyber attacks. With the base strategy determined by Nash Equilibrium, our objective is to find an additional budget allocation strategy that bring most marginal loss reduction. We propose a weighted estimated greedy algorithm, and introduce a re-estimate interval to improve computational efficiency. Numerical calculation indicates that the budget allocation strategy designed by our greedy algorithm performs better than that by existing approaches based on various centrality measures.

邀请人：张志民

欢迎广大师生积极参与！