Metraipolis › archive › dc_edef2b285781
Dynamical low-rank equilibrium computation for stochastic games between advanced persistent threats and moving target defense — arXiv:2610.06885
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.06885
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:19:59.822Z
- SHA-256 of the archived text
8aa4af86933712f548d681bff479d7940c84c9a8c99d868f84b7ebfebdb72098- Stable URL of this page
https://metraipolis.com/documento/dc_edef2b285781
How to cite
Dynamical low-rank equilibrium computation for stochastic games between advanced persistent threats and moving target defense — arXiv:2610.06885 — arXiv (en), https://arxiv.org/abs/2610.06885 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_edef2b285781 (Metraipolis archive dc_edef2b285781, sha256 8aa4af86933712f548d681bff479d7940c84c9a8c99d868f84b7ebfebdb72098)
BibTeX
@misc{dcedef2b285781,
title = {Dynamical low-rank equilibrium computation for stochastic games between advanced persistent threats and moving target defense — arXiv:2610.06885},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.06885},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_edef2b285781; sha256 8aa4af86933712f548d681bff479d7940c84c9a8c99d868f84b7ebfebdb72098},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06885. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Moving target defense (MTD) against advanced persistent threats (APTs) in industrial control systems (ICS) has well-established game-theoretic formulations, but their practical value hinges on equilibrium computation: full-rank value iteration is prohibitively expensive at industrial state dimensions, and the resulting defense strategies admit no certified robustness against adversarial perturbations. We first reveal that the attack and defense influence matrices of ICS dynamics are intrinsically low-rank: APTs infiltrate through a handful of entry points, and MTD reconfigures only a limited subset of components per cycle. We prove that this structure propagates through the non-smooth Bellman operator of the zero-sum stochastic game: an augmented gradient matrix bridging physical and algorithmic low rank certifies that every Bellman target lies near a low-dimensional subspace, with an explicit error bound on the optimal value function. Because these subspaces drift under value iteration, static low-rank projections are inadequate. We therefore propose dynamical low-rank equilibrium computation (DLR-NE), which augments the rank-r search space at each iteration, regularizes the core matrix spectrum, and retracts via truncated SVD, extracting a Nash equilibrium at every step. Four guarantees follow: explicit approximation error; geometric convergence to a neighborhood with five physically interpretable error sources; per-step cost O(nr^2), a Theta(n/r^2) speedup over full-rank value iteration; and robustness in which a single weight trades accuracy against certified safety. Experiments on a nonlinear power-system testbed confirm each prediction, with 94% parameter compression at 0.16% utility loss. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Computer Science and Game Theory (cs.GT) ; Artificial Intelligence (cs.AI); Cryptography and Security (cs.CR); Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2610.06885 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T11:15:24.642Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).