arXiv Analytics

Sign in

arXiv:1506.02890 [cs.IT]AbstractReferencesReviewsResources

Constrained Bimatrix Games in Wireless Communications

Koorosh Firouzbakht, Guevara Noubir, Masoud Salehi

Published 2015-06-09Version 1

We develop a constrained bimatrix game framework that can be used to model many practical problems in many disciplines, including jamming in packetized wireless networks. In contrast to the widely used zero-sum framework, in bimatrix games it is no longer required that the sum of the players' utilities to be zero or constant, thus, can be used to model a much larger class of jamming problems. Additionally, in contrast to the standard bimatrix games, in constrained bimatrix games the players' strategies must satisfy some linear constraint/inequality, consequently, not all strategies are feasible and the existence of the Nash equilibrium (NE) is not guaranteed anymore. We provide the necessary and sufficient conditions under which the existence of the Nash equilibrium is guaranteed, and show that the equilibrium pairs and the Nash equilibrium solution of the constrained game corresponds to the global maximum of a quadratic program. Finally, we use our game theoretic framework to find the optimal transmission and jamming strategies for a typical wireless link under power limited jamming.

Comments: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible
Categories: cs.IT, math.IT
Related articles: Most relevant | Search more
arXiv:1808.01707 [cs.IT] (Published 2018-08-06)
New Viewpoint and Algorithms for Water-Filling Solutions in Wireless Communications
arXiv:1407.8469 [cs.IT] (Published 2014-07-31, updated 2015-02-25)
On the Equivalence between Interference and Eavesdropping in Wireless Communications
arXiv:1702.03250 [cs.IT] (Published 2017-02-10)
Multidimensional Index Modulation in Wireless Communications