What we know
The authors formulate a two-player dynamic game to model honeypot allocation in tactical networks whose connectivity changes with node mobility. They propose an iterative algorithm to find Nash equilibria and assess scalability through compact states and sensitivity analysis under imperfect information.
Evidence limits
Assessment based solely on the Crossref-deposited abstract, without full-text reading or independent validation of results.
Reviewed: author abstract. Full-text results were not analyzed.
Sources and provenance
- Strategic Honeypot Allocation in Dynamic Networks: A Game-Theoretic Approach for Enhanced Cybersecurity
abstract · 2026-10-11
Reviewed: 2026-10-16. This record may change when new evidence is found.