A jamming game for fleets of mobile vehicles

Abstract We consider a two-player Nash game in which each player represents a fleet of unmanned aerial vehicles. Each fleet is supposed to distribute information among fleet members while simultaneously trying to prevent the opposite fleet from achieving this. Using the electromagnetic spectrum’s properties, we model each fleet’s task as a nonlinear Nash game. By reformulating conditions for Nash equilibria, we provide a fixed-point algorithm for this game and show its convergence under mild conditions. In practice, the game considered will often be solved in a distributed setting, where each member of each fleet computes information separately. We thus propose a corresponding distributed optimization algorithm and show its convergence. Numerical results illustrate the flexibility of our approach.