Research Article
A Stochastic Bandwidth Scanning Game
@INPROCEEDINGS{10.1007/978-3-031-23141-4_18, author={Andrey Garnaev and Wade Trappe}, title={A Stochastic Bandwidth Scanning Game}, proceedings={Game Theory for Networks. 11th International EAI Conference, GameNets 2022, Virtual Event, July 7--8, 2022, Proceedings}, proceedings_a={GAMENETS}, year={2023}, month={1}, keywords={Non-zero sum stochastic game Detection Equilibrium}, doi={10.1007/978-3-031-23141-4_18} }- Andrey Garnaev
Wade Trappe
Year: 2023
A Stochastic Bandwidth Scanning Game
GAMENETS
Springer
DOI: 10.1007/978-3-031-23141-4_18
Abstract
In this paper we consider a dilemma that arises in bandwidth scanning problems associated with the design of agents’ scanning strategies based on the principle of rationality and the principle of insufficient reasons. On one hand, engaging tools that estimate a network’s parameters allows an agent to act rationally to maximize its payoff. On the other hand, utilizing such engagement incurs extra costs associated with scanning. In particular, if the agent does not employ such tools, then the involved expenses can be reduced, although such a strategy might also cause a reduction in detection probability since in such cases the agent has to design strategy based on the principle of insufficient reasons (also called principle of indifference). In this paper we model this dilemma as a non-zero sum stochastic game between two players (Scanner and Invader). The equilibrium is found in closed form in stationary strategies via solving the corresponding Shapley-Bellman equations, and its dependence on network parameters is illustrated.
