Zero-determinant strategies achieve the upper-bound performance of strong Stackelberg equilibria in moving target defense with substantially lower computational complexity.
Also, fork=K,−ϕ min −k =−ϕ K−1 ⩽U u d (K) +βU u a (K) +γand ϕmax −ϕ max −k
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Zero-determinant Strategy for Moving Target Defense: Existence, Performance, and Computation
Zero-determinant strategies achieve the upper-bound performance of strong Stackelberg equilibria in moving target defense with substantially lower computational complexity.