Optimal Scanning Bandwidth Strategy Incorporating Uncertainty about Adversary's Characteristics
Andrey Garnaev, Wade Trappe

TL;DR
This paper develops a game-theoretic model for spectrum scanning strategies to detect intelligent invaders, accounting for uncertainties and social factors, and derives explicit equilibrium strategies with practical implications.
Contribution
It introduces a sequential game framework for optimal spectrum scanning under uncertainty and reveals threshold effects in deterrence strategies.
Findings
Explicit equilibrium strategies are derived.
Discontinuous dependence on network parameters and fines.
Incorporates incomplete information about invader characteristics.
Abstract
In this paper we investigate the problem of designing a spectrum scanning strategy to detect an intelligent Invader who wants to utilize spectrum undetected for his/her unapproved purposes. To deal with this problem we model the situation as two games, between a Scanner and an Invader, and solve them sequentially. The first game is formulated to design the optimal (in maxmin sense) scanning algorithm, while the second one allows one to find the optimal values of the parameters for the algorithm depending on parameters of the network. These games provide solutions for two dilemmas that the rivals face. The Invader's dilemma consists of the following: the more bandwidth the Invader attempts to use leads to a larger payoff if he is not detected, but at the same time also increases the probability of being detected and thus fined. Similarly, the Scanner faces a dilemma: the wider the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
