Packetized wireless communication under jamming, a constrained bimatrix game

We develop a constrained bimatrix game framework to model a packetized wireless communication link under jamming where the players' strategies must be chosen from some hyper-polyhedron defined by linear inequalities. In contrast to the widely used zero-sum framework, in bimatrix games it is no longer required that the sum of the players' payoffs to be zero (or a constant value). This allows us to model much larger class of jamming problems including scenarios where the players pursue different goals or have different views of the communication system. We provide the necessary and sufficient conditions under which the existence of the Nash equilibrium (NE) for the constrained bimatrix game is guaranteed. We study a typical jamming problem and show that the jammer can improve his payoff by switching from a zero-sum game to a bimatrix game.