Hong Qian , Yu-Peng Wu , Rong-Jun Qin , Xin An , Yi Chen , Aimin Zhou
{"title":"基于可扩展多目标安全博弈的可证明空间离散化进化搜索","authors":"Hong Qian , Yu-Peng Wu , Rong-Jun Qin , Xin An , Yi Chen , Aimin Zhou","doi":"10.1016/j.swevo.2024.101770","DOIUrl":null,"url":null,"abstract":"<div><div>In the field of security, multi-objective security games (MOSGs) allow defenders to simultaneously protect targets from multiple heterogeneous attackers. MOSGs aim to simultaneously maximize all the heterogeneous payoffs, e.g., life, money, and crime rate, without merging heterogeneous attackers. In real-world scenarios, the number of targets and heterogeneous attackers may exceed the capability of most existing state-of-the-art (SOTA) methods, i.e., MOSGs are limited by the issue of scalability. In fact, there is still a lack of algorithms to improve scalability while ensuring accuracy. To this end, this paper proposes a general framework named Space Discretization based Evolutionary Search (SDES) based on many/multi-objective evolutionary algorithms (MOEAs) to scale up MOSGs to large-scale targets and heterogeneous attackers. SDES consists of four consecutive key components, i.e., discretization, optimization, evaluation, and refinement. Specifically, SDES first discretizes the originally high-dimensional continuous solution space to the low-dimensional discrete one by the maximal indifference property in game theory. This property helps EAs bypass the high-dimensional step function and simplify the solution of large-scale MOSGs. Then, MOEAs are used for optimization in the low-dimensional discrete solution space to obtain a well-spaced Pareto front. To evaluate solutions, SDES restores solutions back to the original space via greedily optimizing a novel divergence measurement. Finally, the refinement in SDES boosts the optimization performance with acceptable cost. Theoretically, we prove the optimization consistency and convergence of SDES. Experiment results show that SDES is the first linear-time MOSG algorithm for both large-scale attackers and targets. SDES can solve up to 20 attackers and 100 targets MOSG problems, while SOTA methods can only solve up to 8 attackers and 25 targets. An ablation study verifies the necessity of all components in SDES.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"92 ","pages":"Article 101770"},"PeriodicalIF":8.2000,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Provable space discretization based evolutionary search for scalable multi-objective security games\",\"authors\":\"Hong Qian , Yu-Peng Wu , Rong-Jun Qin , Xin An , Yi Chen , Aimin Zhou\",\"doi\":\"10.1016/j.swevo.2024.101770\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In the field of security, multi-objective security games (MOSGs) allow defenders to simultaneously protect targets from multiple heterogeneous attackers. MOSGs aim to simultaneously maximize all the heterogeneous payoffs, e.g., life, money, and crime rate, without merging heterogeneous attackers. In real-world scenarios, the number of targets and heterogeneous attackers may exceed the capability of most existing state-of-the-art (SOTA) methods, i.e., MOSGs are limited by the issue of scalability. In fact, there is still a lack of algorithms to improve scalability while ensuring accuracy. To this end, this paper proposes a general framework named Space Discretization based Evolutionary Search (SDES) based on many/multi-objective evolutionary algorithms (MOEAs) to scale up MOSGs to large-scale targets and heterogeneous attackers. SDES consists of four consecutive key components, i.e., discretization, optimization, evaluation, and refinement. Specifically, SDES first discretizes the originally high-dimensional continuous solution space to the low-dimensional discrete one by the maximal indifference property in game theory. This property helps EAs bypass the high-dimensional step function and simplify the solution of large-scale MOSGs. Then, MOEAs are used for optimization in the low-dimensional discrete solution space to obtain a well-spaced Pareto front. To evaluate solutions, SDES restores solutions back to the original space via greedily optimizing a novel divergence measurement. Finally, the refinement in SDES boosts the optimization performance with acceptable cost. Theoretically, we prove the optimization consistency and convergence of SDES. Experiment results show that SDES is the first linear-time MOSG algorithm for both large-scale attackers and targets. SDES can solve up to 20 attackers and 100 targets MOSG problems, while SOTA methods can only solve up to 8 attackers and 25 targets. An ablation study verifies the necessity of all components in SDES.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"92 \",\"pages\":\"Article 101770\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2024-11-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Swarm and Evolutionary Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210650224003080\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650224003080","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Provable space discretization based evolutionary search for scalable multi-objective security games
In the field of security, multi-objective security games (MOSGs) allow defenders to simultaneously protect targets from multiple heterogeneous attackers. MOSGs aim to simultaneously maximize all the heterogeneous payoffs, e.g., life, money, and crime rate, without merging heterogeneous attackers. In real-world scenarios, the number of targets and heterogeneous attackers may exceed the capability of most existing state-of-the-art (SOTA) methods, i.e., MOSGs are limited by the issue of scalability. In fact, there is still a lack of algorithms to improve scalability while ensuring accuracy. To this end, this paper proposes a general framework named Space Discretization based Evolutionary Search (SDES) based on many/multi-objective evolutionary algorithms (MOEAs) to scale up MOSGs to large-scale targets and heterogeneous attackers. SDES consists of four consecutive key components, i.e., discretization, optimization, evaluation, and refinement. Specifically, SDES first discretizes the originally high-dimensional continuous solution space to the low-dimensional discrete one by the maximal indifference property in game theory. This property helps EAs bypass the high-dimensional step function and simplify the solution of large-scale MOSGs. Then, MOEAs are used for optimization in the low-dimensional discrete solution space to obtain a well-spaced Pareto front. To evaluate solutions, SDES restores solutions back to the original space via greedily optimizing a novel divergence measurement. Finally, the refinement in SDES boosts the optimization performance with acceptable cost. Theoretically, we prove the optimization consistency and convergence of SDES. Experiment results show that SDES is the first linear-time MOSG algorithm for both large-scale attackers and targets. SDES can solve up to 20 attackers and 100 targets MOSG problems, while SOTA methods can only solve up to 8 attackers and 25 targets. An ablation study verifies the necessity of all components in SDES.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.