.png){kind=icon}
Return
Coordinated Attack Planning in Probabilistic Attack Graphs within a Sensor-Allocated Network
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-09315-8_8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Modern cyberattacks increasingly involve coordinated teams of adversaries, posing new challenges for detection and defense. This paper introduces a probabilistic framework for modeling such multi-agent attacks, combining Markov Decision Processes with an augmented Markov game that captures dynamic team composition under detection events. The model integrates state-dependent detection probabilities, implicit coordination via reward structures, and efficient value iteration for policy computation. Through a stochastic grid-world case study, we analyze the performance trade-offs between isolated and coordinated strategies. Our results reveal that while isolated agents perform better in simple, single-target scenarios, coordinated strategies significantly improve success rates in complex, multi-target operations by systematically managing exposure. This work provides a formal foundation and practical methodology for analyzing emergent attack behaviors in adversarial environments.
Keywords:
Multi-agent
Coordinated attack
Markov process
Valueiteration
Journal
N
IF:
0
Papers:
16
Citations:
0
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSave View more