Deep Reinforcement Learning for Short-Duration FlipIt Security Game
摘要
We present a deep reinforcement learning model that enables agents to learn optimal counter-strategies in partially observable games without prior knowledge of opponent behavior. Using FlipIt, a two-player security game where players compete for resource ownership with limited state information, we combine deep neural networks with Q-learning to maximize the defender’s resource ownership time. Our approach learns solely through observing opponent moves and adapting to their patterns. We derive the theoretical optimal strategy for defenders facing attackers with unknown probability distributions and demonstrate that our model learns cost-effective counter-strategies aligned with theoretical predictions. This work advances reinforcement learning applications in partially observable security games with implications for cybersecurity.