2011/06/14 by Luca Rose, Rose, Luca, Samir M. Perlaza +3
Business, Management and Accounting · Computer Science · Decision Sciences · Mathematics · #Channel (broadcasting) #Computer Science and Game Theory (cs.GT) #Computer network #Computer science #Cooperative Communication and Network Coding #Digital Platforms and Economics #Distributed computing #FOS: Computer and information sciences #Game Theory and Applications #Game theory #Interference (communication) #Mathematical economics #Mathematics #Nash equilibrium #cs.GT
paper · pdf · open access · doi:10.48550/arxiv.1106.2650
6 pages, 4 figures, presented in ICCC Kyoto 2011
arxiv created 2011/06/14 · openalex publication_date 2011/06/14 · arxiv updated 2011/06/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, the 2-dimensional decentralized parallel interference channel (IC) with 2 transmitter-receiver pairs is modelled as a non-cooperative static game. Each transmitter is assumed to be a fully rational entity with complete information on the game, aiming to maximize its own individual spectral efficiency by tuning its own power allocation (PA) vector. Two scenarios are analysed. First, we consider that transmitters can split their transmit power between both dimensions (PA game). Second, we consider that each transmitter is limited to use only one dimension (channel selection CS game). In the first scenario, the game might have either one or three NE in pure strategies (PS). However, two or infinitely many NE in PS might also be observed with zero probability. In the second scenario, there always exists either one or two NE in PS. We show that in both games there always exists a non-zero probability of observing more than one NE. More interestingly, using Monte-Carlo simulations, we show that the highest and lowest network spectral efficiency at any of the NE in the CS game are always higher than the ones in the PA.