Adversarial Online Learning with Variable Plays in the Pursuit-Evasion Game: Theoretical Foundations and Application in Connected and Automated Vehicle Cybersecurity

Abstract

We extend the adversarial/non-stochastic multi-play multi-armed bandit (MPMAB) to the case where the number of arms to play is variable. The work is motivated by the fact that the resources allocated to scan different critical locations in an interconnected transportation system change dynamically over time and depending on the environment. By modeling the malicious hacker and the intrusion monitoring system as the attacker and the defender, respectively, we formulate the problem for the two players as a sequential pursuit-evasion game. We derive the condition under which a Nash equilibrium of the strategic game exists. For the defender side, we provide an exponential-weighted based algorithm with sublinear pseudo-regret. We further extend our model to heterogeneous rewards for both players, and obtain lower and upper bounds on the average reward for the attacker. We provide numerical experiments to demonstrate the effectiveness of a variable-arm play.

arXiv commentPublished in IEEE Access. DOI: 10.1109/ACCESS.2021.3120700

References in corpus (6)

• GIDS: GAN based Intrusion Detection System for In-Vehicle Network
• Adversarial Sensor Attack on LiDAR-based Perception in Autonomous Driving
• Real-Time Sensor Anomaly Detection and Recovery in Connected Automated Vehicle Sensors
• The on-line shortest path problem under partial monitoring
• Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays
• Adversarial Objects Against LiDAR-Based Autonomous Driving Systems