Equilibria of Channel Selection Games in Parallel Multiple Access Channel

In this paper, we study the decentralized parallel multiple access channel (MAC) when transmitters selfishly maximize their individual spectral efficiency by selecting a single channel to transmit. More specifically, we investigate the set of Nash equilibria (NE) of decentralized networks comprising several transmitters communicating with a single receiver that implements single user decoding. This scenario is modeled as a one-shot game where the players (the transmitters) have discrete action sets (the channels). We show that the corresponding game has always at least one NE in pure strategies, but, depending on certain parameters, the game might possess several NE. We provide an upper bound for the maximum number of NE as a function of the number of transmitters and available channels. The main contribution of this paper is a mathematical proof of the existence of a Braess-type paradox. In particular, it is shown that under the assumption of a fully loaded network, when transmitters are allowed to use all the available channels, the corresponding sum spectral efficiency achieved at the NE is lower or equal than the sum spectral efficiency achieved when transmitters can use only one channel. A formal proof of this observation is provided in the case of small networks. For general scenarios, we provide numerical examples that show that the same effect holds as long as the network is kept fully loaded. We conclude the paper by considering the case of successive interference cancellation at the receiver. In this context, we show that the power allocation vectors at the NE are capacity maximizers. Finally, simulations are presented to verify our theoretical results.


I. INTRODUCTION
Multiple access channels (MAC) correspond to a communication scenario where several transmitters communicate with a single receiver trough a common channel [1]. In parallel MAC, each transmitter can exploit a common set of orthogonal channels to communicate with the receiver. Often, channel orthogonality is assumed in the frequency domain, and thus, channels can be understood as different nonoverlapping frequency bands. This model allows one to study communication scenarios such as 802.11based wireless local area networks (WLANs) [2], [3], distributed soft or hard handovers in cellular systems [4], or throughput-maximizing power control in multi-carrier code division multiple access (MC-CDMA) systems [5].
In this paper, we analyze the parallel MAC assuming that transmitters selfishly maximize their individual spectral efficiency (ISE) by autonomously selecting a single channel to perform their transmission. Here, the channel selection policy is not imposed by the receiver to the transmitters, which justifies the terms decentralized parallel MAC. The motivation for studying this scenario and, in particular, the limitation of using a single channel for transmitting, stems from the fact that this is often a practical constraint in some wireless networks, for instance, Wi-Fi networks. Moreover, the choice of enforcing radio devices to use only a subset of all the available channels has been proved to be beneficial in the case of rateefficient centralized parallel MAC when using successive interference cancellation [4]. In the case of energy-efficient decentralized parallel MAC, it has been shown that using a single channel is a dominant strategy [5]. Within this framework, we study this scenario, to which we refer to as channel selection (CS) problem, using a one-shot game model. The players (the transmitters) have discrete action sets (the channels) and their utility function (performance metric) corresponds to their ISE. Our interest focuses on the analysis of the set of Nash equilibria (NE) [6] of this game. The relevance of the NE relies, in part, on the fact that it describes a network state where the channel used by each transmitter is individually optimal with respect to the channels adopted by all the other transmitters in the network. Another reason is that an NE can be reached in a fully decentralized fashion when radio devices interact during certain time following particular behavioral rules [7], [8]. We distinguish the CS game described above from the power allocation (PA) game. In the PA game, transmitters can simultaneously use all the available channels, and thus, the set of actions is a convex and closed set [9]. Indeed, the PA problem in decentralized parallel MAC has been well investigated in the wireless literature [9]- [13]. In these works, the main contribution consists in conducting a complete analysis of the set of NE of the corresponding one-shot games. Nonetheless, very few is known about the set of equilibria in decentralized parallel MAC, with CS policies. As we shall see, by dropping the convexity of the set of actions, fundamental differences arise. For instance, the uniqueness of the NE no longer holds. Although the parallel MAC is, in terms of signal model, a special case of the MIMO (multiple input multiple output) interference channel (IC), the NE analysis of the MIMO-IC [14]- [18] does not directly apply to the case of parallel MAC. First, [10], [11] address the case of fast fading links and shows substantial differences between both models especially in terms of the uniqueness of the NE. Second, even if identical channel variation models are considered in the MIMO-IC and parallel MAC, the sufficient condition for the uniqueness of the NE derived in [14], [19] for static or block fading IC, can be shown to hold with probability zero in parallel MAC [9]. In particular, the sufficient condition for the uniqueness of the NE provided in [14] is not necessary in general [20]. The (more explicit) sufficient conditions for uniqueness given by [19] are generally not verified in parallel MAC. More precisely, from [19] it is implied that there exists a unique pure NE with high probability when for each point-to-point communication the signal dominates the interference. This condition is clearly not verified in parallel MAC. For instance, in a 2-user parallel MAC, if one user's signal is dominated by the interference, the converse holds for the other user. Finally, we highlight that in the parallel MAC, when single-user decoding (SUD) is assumed at the receiver, both the compact power allocation and channel selection games have a special structure, namely, they are potential games [21] or more specifically, best-response potential games [22]. This structure is not observed in the case of the MIMO-IC model. In Sec. III, we discuss the implications and advantages derived from this fact. Within this context, the main contributions of this paper are described hereunder.
• The set of NE of the decentralized parallel MAC is fully described in the case of CS policies and single user decoding at the receiver. This set is shown to be non-empty and an upper bound of its cardinality is provided as a function of the number of transmitters and available channels. • In the 2-transmitter 2-channel case, it is formally proved that for any realization of the channel gains, there always exists at least one NE in the CS game that produces a higher or equal network spectral efficiency (NSE) than the unique NE in the PA game. In wireless communications, this kind of observations is often associated with a Braess type paradox [23] as in [20], [24], [25], where similar observations have been made in other scenarios. For an arbitrary number of transmitters and channels, we only provide numerical results that support the aforementioned claim. • The set of NE of the decentralized parallel MAC is also studied in the asymptotic regime, that is for a large number of transmitters in the case of CS policies. In this context, we provide closed-form expressions of the fraction of players which transmit over each channel as a function of the ratio between the channel bandwidth and the total available bandwidth (sum of all channel bandwidths). • Finally, we study the efficiency of the set of equilibria in terms of the price of anarchy and the price of stability. We provide closed-form conditions over which no loss of performance is observed at the equilibrium in both the power allocation game and the channel selection game. The content of this paper can be briefly summarized as follows. In Sec. II, the system and game models are described. In Sec. III, we revisit the existing results regarding the PA problem and we provide new results on the CS problem in terms of existence and uniqueness of the NE. In Sec. IV, the contribution aforementioned are fully detailed. In Sec. V, we present simulation results in order to verify our theoretical results. The paper is concluded by Sec. VI.

A. System Model
Let us define the sets K = {1, . . . , K} and S = {1, . . . , S}. Consider a parallel multiple access channel with K transmitters and S channels (namely non-overlapping bands). Denote by y = (y 1 , . . . , y S ) T the S-dimensional vector representing the received signal, which can be written in the baseband at the symbol rate as follows Here, ∀k ∈ K, H k is the channel transfer matrix from transmitter k to the receiver, x k is the vector of symbols transmitted by transmitter k, and vector w represents the noise observed at the receiver. We will exclusively deal with the scenario where the matrices H k are S-dimensional diagonal matrices (parallel MAC), i.e., H k = diag (h k,1 , . . . , h k,S ). In our analysis, block fading channels are assumed. Hence, for each channel use, the entries h k,s , for all (k, s) ∈ K × S, are time-invariant realizations of a complex circularly symmetric Gaussian random variable with zero mean and unit variance. Here, we assume that each transmitter is able to perfectly estimate its own channel realizations (coherent communications), i.e., the channels h k,1 . . . h k,S for transmitter k. The vector of transmitted symbols x k , ∀k ∈ K, is an S-dimensional complex circularly symmetric Gaussian random variable with zero mean and covariance Assuming the transmit symbols to be Gaussian and independent is optimal in terms of spectral efficiency, as shown in [26], [27]. For all (k, s) ∈ K × S, p k,s represents the transmit power allocated by transmitter k over channel s and transmitters are power-limited, that is, where p k,max is the maximum transmit power of transmitter k. A PA vector for transmitter k is any vector p k = (p k,1 , . . . , p k,S ) with non-negative entries satisfying (2). The noise vector w is an S-dimensional zero mean Gaussian random variable with independent, equal variance real and imaginary parts. Here, E ww H = diag (σ 2 1 , . . . , σ 2 S ), where, σ 2 s represents the noise power over channel s. We respectively denote the noise spectral density and the bandwidth of channel s by N 0 and B s , thus, σ 2 s = N 0 B s . The total bandwidth is denoted by B = S s=1 B s .

B. Game Models
The PA and CS problems described in Sec. I can be respectively modeled by the following two noncooperative static games in strategic form (with i ∈ {a, b}): In both games, the set of transmitters K is the set of players. An action of a given transmitter k ∈ K is a particular PA scheme, i.e., an S-dimensional PA vector p k = (p k,1 , . . . , p k,S ) ∈ P k is the set of all possible PA vectors which transmitter k can use either in the game G (a) (i = a) or in the game G (b) (i = b). An action profile of the game i ∈ {a, b} is a super vector where P (i) is a set obtained from the Cartesian product of all the action sets, i.e., P (i) = P (p k,1 , . . . p k,S ) ∈ R S : ∀s ∈ S, p k,s 0, s∈S p k,s p k,max , and P (b) k = {p k,max e s : ∀s ∈ S, e s = (e s,1 , . . . , e s,S ) , ∀r ∈ S \ s, e s,r = 0, and e s,s = 1} .
In the sequel, we respectively refer to the games G (a) and G (b) as the PA game and CS game. Moreover, we drop the super-indices (a) or (b) when interchangeably referring to the game G (a) or G (b) . Let us denote by p −k any vector in the set with (i, k) ∈ {a, b} × K. For a given k ∈ K, the vector denoted by p −k represents the strategies adopted by all the players other than player k. With a slight abuse of notation, we can write any vector p ∈ P (i) as p k , p −k , in order to emphasize the k-th component of the super vector p. The utility for player k in the game G (i) is its spectral efficiency u k : P (i) → R + , and where γ k,s is the signal-to-interference plus noise ratio (SINR) seen by player k over its channel s, i.e., and g k,s |h k,s | 2 . Note that from (6), it is implied that single-user decoding (SUD) is used at the receiver. The choice of SUD is basically due to scalability (in terms of signaling cost) and fairness for the decoding scheme. Clearly, optimality is not sought here, nonetheless, these constraints are inherit to the decentralized nature of the network. As a solution concept for both G (a) and G (b) , we focus on the notion of NE [6], which we define, using our notation, as follows, Definition 1 (Pure Nash Equilibrium): In the non-cooperative games in strategic form G (i) , with i ∈ {a, b}, an action profile p ∈ P (i) is a pure NE if it satisfies, for all k ∈ K and for all p k ∈ P The relevance of the NE is that at such state, the PA or CS policy chosen by any transmitter is optimal with respect to the choice of all the other transmitters. Thus, in a decentralized network, the NE is a stable network state, since no player has a particular interest in deviating from the actual state.
In the following, we provide some fundamental results which we use in the further analysis of the games G (a) and G (b) .

III. AUXILIARY RESULTS
In this section, we introduce some existing results on the existence and uniqueness of the NE in the games G (a) and G (b) . For doing so, we use the fact that both games G (a) and G (b) have been shown to be potential games (PG) [21], [28] in [4] and [29], respectively. We conclude this section, by introducing a new result which allows us to establish an upper bound on the number of NE that the game G (b) might possess.

A. General Results
The analysis presented in the following strongly relies on the fact that both games G (a) and G (b) are potential games. Thus, for the sake of completeness, we define exact PGs using our notation.
Definition 2 (Exact Potential Game): Any game in strategic form defined by the triplet is an exact potential game if there exists a function φ (p) for all p ∈ P = P 1 × . . . × P K such that for all players k ∈ K and for all p k ∈ P k , it holds that Note that the utility function of player k can be written as follows, where, p k,s g k,s and, Interestingly, the first term φ(p) does not depend on the index of k and the term υ k p −k does not depend on the actions of player k. Thus, the results initially mentioned by the authors in [4] and [29] follow immediately from (8) and Def. 2: Lemma 1: The strategic form games G (i) , with i ∈ {a, b}, are exact potential games with potential function φ(p) : P (i) → R + defined in (9). The relevance of PG relies on the fact that it is a class of games for which the existence of at least one pure NE is always guaranteed [21]. Additionally, many known learning procedures, such as, best response dynamics, fictitious play and some reinforcement learning dynamics converge in PG. As a consequence, any of these dynamics can be used to implement algorithms to achieve an equilibrium in a fully decentralized fashion. Nonetheless, we leave the design of decentralized techniques for achieving NE out of the scope of this paper and we focus on the analysis of the equilibria. We refer the interested reader to [7], [8], [13], [14], [30] for more details. In the following, we use Lemma 1 to analyze the set of NE of both our power allocation game G (a) and our channel selection game G (b) .

B. Known Results Concerning the Power Allocation Game G (a)
In the following, we comment on the existence and uniqueness of the NE in G (a) . 1) Existence of a NE: Regarding the existence of pure NE, the following lemma is an immediate consequence of our Lemma 1 and Lemma 4.3 in [21].
Lemma 2 (Existence of a pure NE): The game G (a) has always at least one NE in pure strategies. Regarding the existence of a mixed NE (i.e., a probability distribution on the possible actions which verifies Definition 1), it follows from [31], that the existence of at least one NE in mixed strategies always exists. This is basically because the action spaces, P (a) k are compact spaces and the utility functions are continuous with respect to the action profile. However, in compact strategy spaces, mixed strategies are generally less attractive due to the difficulty of its implementation in wireless communications systems [8].
2) Uniqueness of the pure NE: In the game G (a) , the uniqueness of the NE has been shown to hold with probability one [9].
Theorem 1 (NE uniqueness in parallel MAC): The game G (a) has almost surely a unique pure NE. A formal proof of Theorem 1 is provided in [9]. This proof is based on the concept of degeneracy which allows one to characterize the directions along which the potential remains constant. A simpler proof, for the special case of 2 -players and 2-channels is given in [32].
3) Determination of the NE: From Def. 2, it follows that the unique NE in pure strategies, denoted by p † , is the unique solution of the following optimization problem: The components of the PA vector p † in (11) are for all (k, s) ∈ K × S, where, β k is a Lagrangian multiplier chosen to saturate the power constraints (2). Note that this result shows the connections between the notion of NE and the well-known water-filling PA policy [13]. For a further discussion on this connection, the reader is referred to [7], [8].

C. New Results Concerning the Channel Selection Game G (b)
In the game G (b) , it can be checked that given a vector p −k ∈ P (b) −k , it follows that ∀k ∈ K and ∀p k ∈ [0, p k,max ], the potential function satisfies that φ p k e s , p −k φ p k,max e s , p −k , where e s = (e s,1 , . . . , e s,S ) ∈ R S , ∀r ∈ S \ s, e s,r = 0, and e s,s = 1. Thus, the problem of transmit power control disappears and there is no lost of generality by choosing the action sets as P (b) k . Technically, the main difference between G (a) and G (b) is that the latter is a finite game (|K × S| < +∞). In the following, we investigate the consequences of this fact on the existence and multiplicity of the NE .
1) Existence of a pure NE: Regarding the existence of at least one NE in pure strategies, we have that from our Lemma 1 and Corollary 2.2 in [21], the following lemma holds.
Lemma 3 (Existence of a pure NE): The game G (b) has always at least one NE in pure strategies. Regarding the existence of an equilibrium in mixed strategies, we have that given that the actions sets are discrete and finite, then the existence of at least one NE in mixed strategies is ensured [6].
2) Multiplicity of the pure NE: In the following, we show that multiple NE might exists in the game Proposition 1: LetK ∈ N be the highest even number which is less or equal to K. Then, the game G (b) has L pure NE strategy profiles, where, The proof of Proposition 1 is given in Appendix A. This proof relies on the fact that whenever a player deviates from a given action profile p, it achieves a different utility. That is, given a set of channels {g ij } ∀(i,j)∈K×S , it holds that u k (p) = u k (p ), where p is obtained by letting only one transmitter to deviate from p. This holds from the fact that the channel realizations are drawn from a continuous distribution and thus, Pr (u k (p) = u k (p ) | p = p ) = 0. Thus, under this condition, if p is an NE, then p is not and vice versa. Following this procedure, a set of action profiles can be eliminated and only some actions profiles which are NE candidates are left over. In this way, a bound on the maximum number of equilibria can be provided independently of the exact channel realizations and only relying on the parameters K and S.  Indeed, this is one of the main properties of the bound provided by Proposition 1 since, a calculation of the exact number of NE becomes cumbersome when the number of transmitters K and channels S grows to infinity. As we shall see, the bound in Proposition 1 holds with strict equality in the case of K = 2 transmitters and S = 2 channels, that is, 1 L 2. For an arbitrary number of transmitters K > 2 and channels S > 2, the bound is not tight. This is basically because, some of the action profiles obtained using the elimination processes described before might be mutually exclusive of the set of NE. For instance, in the game G (b) with K = 3 and S = 2, the set of power allocation vectors p max (e 1 , e 1 , e 1 ), p max (e 1 , e 2 , e 2 ), p max (e 2 , e 2 , e 1 ), and p max (e 2 , e 1 , e 2 ) might all be NE candidates. Nonetheless, if p max (e 1 , e 1 , e 1 ) is an equilibrium for a given vector of channels {g ij } ∀(i,j)∈K×S , then the other three action sets are not NE for the same set of channels and vice-versa. Thus, only 3 out of the 4 candidates can be NE simultaneously. The exact number of NE can be determined following the method described in the following section, but it requires the complete knowledge of the channel gains. Proposition 1 aims at providing an estimation based only on the parameters K and S.
3) Determination of the NE: In order to fully identify the action profiles corresponding to an NE, we use the graph G described in the proof of Proposition 1 in Appendix A. Basically, we convert the nondirected graph G into an oriented graphĜ whose adjacency matrix is the non-symmetric square matrix A whose entries are ∀(i, j) ∈ I 2 and i = j, andâ i,i = 0 for all i ∈ I. The set V j contains the indices of all the vector that can be obtained by letting only one player to deviate from the action profile p (j) . This set is also called the neighborhood of action profile p (j) . More specifically, in the oriented graphĜ, there exists an edge or arrow starting in vertex v i and ending in vertex v j , i.e.,â ij = 1, if and only if φ(p (j) ) > φ(p (i) ) and φ(p (i) ) is in the neighborhood of φ(p (j) ). Note that the first condition for adjacency inĜ represents the assumption of rational players. That is, a player changes its strategy if the new strategy brings a higher utility, i.e., it increases the potential function. The second condition enforces the fact that only one player can deviate at a time from the initial action profile p (i) . In Fig. 1, we show an example of the non-directed G graph and how it is transformed into an oriented graphĜ for the case where K = 3 and S = 2.
From the definition of the matrixÂ, we have that a necessary and sufficient condition for a vertex v i to represent an NE action profile is to have a null out-degree in the oriented graphĜ, i.e., there are no outgoing edges from the node v i (sink vertex). Finally, one can conclude that determining the set of NE in the game G (b) boils down to identifying all the sink vertices in the oriented graphĜ. Note that this method can be used only to determine the whole set of NE. It does not pretend to be an algorithm which can be directly implemented in decentralized wireless networks, since it requires complete information at each transmitter. Methods for achieving equilibria in wireless networks are described in [7], [8], [13], [14], [30].
IV. EQUILIBRIUM PERFORMANCE ANALYSIS AND SPECIAL CASES In this section, we study in detail two special cases of relevant interest to understand previous conclusions and provide more insights into decentralized power allocation problem in terms of design. First, the games G (a) and G (b) are studied assuming that there exist only K = 2 transmitters and S = 2 available channels. In particular, we analyze the set of NE action profiles of both games and compare the network spectral efficiency (NSE), U (i) : P (i) → R, obtained by playing both games. Here, for all i ∈ {1, 2}, From this analysis, we conclude that limiting the transmitters to use a single channel brings a better result in terms of network spectral efficiency (15). Second, we consider the case of a large number of transmitters. This study leads to two important conclusions: (i) the fraction of players using a given channel depends mainly on the bandwidth of each channel and not on the exact channel realization nor the number of players and channels; (ii) in the asymptotic regime (K → ∞) both games exhibit the same performance. Before we start, let us introduce the notion of best response correspondence, since it plays a central role in the following analysis. Definition 3 (Best-Response Correspondence): In a non-cooperative game described by the 3-tuple is defined as the best-response correspondence of player k ∈ K, given the actions p −k adopted by all the other players.
A. The 2-Transmitter 2-Channel Case Consider the games G (a) and G (b) with K = 2 and S = 2. Assume also that ∀k ∈ K, p k,max = p max and ∀s ∈ S, σ 2 s = σ 2 and B s = B S . Denote by SNR = pmax σ 2 the average signal to noise ratio (SNR) of each active communication.
1) The power allocation game: Let us denote by p † = p † 1 , p † 2 the NE of the game G (a) . Then, following Def. 1, one can write the following set of inclusions, Note that, for all k ∈ K and for all p −k ∈ P (a) , the set BR k p −k is a singleton (Def. 3) and thus, (17) represents a system of equations. By solving the resulting system of equations (17) for a given realization of the channels {g ij } ∀(i,j)∈K×S , one can determine the NE of the game G (a) . We present such a solution in the following proposition.
be an NE action profile of the game G (a) with channel realizations g = (g 11 , g 12 , g 21 , g 22 ). Then, with probability one, p † is the unique NE and it can be written as follows: 1 + SNR (g 11 + g 21 ) , g 21 g 22 1 + SNR (g 11 + g 21 ) , Nash equilibrium action profiles as a function of the channel ratios g 11 g 12 and g 21 g 22 for the two-player-two-channel game G (a) . The function ψ : R+ → R+ is defined as follows: ψ(x) = 1 + SNR x. The best response function BR k (p −k ), for all k ∈ K, is defined by (12). Here, it has been arbitrarly assumed that ψ(g 21 g 22 , 1+SNRg 21 1+SNRg 12 < g 11 g 12 < 1 + SNR (g 11 + g 21 ) , then, The proof of Proposition 2 is given in Appendix B. In Fig. 2 we plot the different types of NE of the game G (a) as a function of the channel ratios g 11 g 12 and g 21 g 22 . Note that under the knowledge of all channels, the set of all possible pure NE can be obtained by simply placing the point g 11 g 12 , g 21 g 22 in Fig. 2 . The uniqueness of the NE is not ensured under certain conditions. In fact, infinitely many NE can be observed, however, the conditions for this to happen are zero probability events, as we shall see in the following lemma.
Lemma 4: Let α = g 11 g 21 = g 12 g 22 and assume that the set of channels {g ij } ∀(i,j)∈K×S satisfies the following conditions 1 1 + pmax σ 2 (g 12 + g 22 ) Then, any PA vector p = (p 11 , p max − p 11 , p max − p 22 , p 22 ) ∈ P (a) , such that is an NE action profile of the game G (a) . The proof of Lemma 4 is the first part of the proof of Proposition 2. In the next subsection, we perform the same analysis presented above for the game G (b) .
2) The channel selection game: When K = 2 and S = 2, the game G (b) has four possible outcomes, i.e., P (b) = 4. We detail such outcomes and its respective potential in Fig. 3. Following Def. 1, each of those outcomes can be an NE depending on the channel realizations {g ij } ∀(i,j)∈K×S , as shown in the following proposition.

B. A Braess Type Paradox
As suggested in [23], a Braess-type paradox refers to a counter-intuitive observation consisting in a reduction of the individual utility at the equilibria, when the players are granted with a larger set of actions. That is, by letting the players to choose from a larger set of options, their individual benefit reduces. Recently, the Braess-type paradox has been also associated with the reduction of the sum-utility instead of the individual utilities, as in [20], [25], [34] in the wireless communications arena. In our particular case, the set of actions for player k in the game G (b) , is a subset of its set of actions in the game G (a) , i.e., ∀k ∈ K, P k . Interestingly, as observed in [23], reducing the set of actions of Fig. 4. Nash equilibrium action profiles as a function of the channel ratios g 11 g 12 and g 21 g 22 for the two-player-two-channel game G (b) , respectively. The function ψ : R+ → R+ is defined as follows: ψ(x) = 1 + SNR x. The best response function BR k (p −k ), for all k ∈ K, is defined by (12). Here, it has been arbitrarily assumed that ψ(g11) < ψ(g21).
each player leads, in this particular game, to a better global performance. This effect has been reported in the parallel interference channel in [24], [25] under the consideration of particular channel conditions and later, more generally in [20]. However, a formal proof of the existence of this paradox is not provided in the aforementioned references. This observation, has been also reported in the parallel MAC for the case of successive interference cancellation (SIC) in [35]. Nonetheless, the channel in [35] was not fully decentralized, as it required a central controller to dictate the channel policy to all the transmitters. In the following, we study this observation in more detail. Let us denote by p ( †,n) k , the unique NE action profile of game G (a) , when the vector g = (g 11 , g 12 , g 21 , g 22 ) ∈ A n , for all n ∈ {1 . . . , 8}. Let us also denote by p ( * ,n) one of the NE action profiles of game G (b) when (g 11 , g 12 , g 21 , g 22 ) ∈ B n , for all n ∈ {1, . . . 4}. The sets A n and B n are defined in Proposition 2 and 3. Then, for a finite SNR level, one can observe that ∀n ∈ {1, . . . , 4}, A n ∩ B n = A n and ∀g = (g 11 , g 12 , g 21 , g 22 ) ∈ A n , the following equality always holds p ( †,n) k = p ( * ,n) k , which implies the same network performance. However, when the NE of both games are different, one can not easily compare the utilities achieved by each player since they depend on the exact channel realizations. Fortunately, the analysis largely simplifies by considering either a low SNR regime or a high SNR regime and more general conclusions can be stated. The performance comparison between games G (a) and G (b) for the low SNR regime is presented in the following proposition.
Proposition 4: In the low SNR regime, both games G (a) and G (b) , with K = 2 and S = 2, possess a unique NE, denoted by p * . Here, for all k ∈ K and s ∈ S, The proof of Proposition 4 is given in App. C. From, Prop 4, it can be stated that at the low SINR regime, players achieve the NE by simply choosing the channel with the highest channel gain independently of the other player's action. The performance comparison between games G (a) and G (b) for the high SNR regime is presented in the following proposition.
Proposition 5: In the high SNR regime, with K = 2 and S = 2, the game G (a) has a unique pure NE denoted by p † and the game G (b) has two pure NE denoted by p ( * ,1) and p ( * ,4) , respectively. Then, at least for one n ∈ {1, 4}, there exists a SNR value 0 < SNR 0 < ∞, such that ∀SNR SNR 0 , and δ 0. The proof of Proposition 5 is given in App. D. From the proof of Proposition 5, it can be stated that in none of the games, players transmit simultaneously on the same channels. Now, from Proposition 4 and Proposition 5, it can be concluded that at low SNR both games G (a) and G (b) induce the same network spectral efficiency. On the contrary, the game G (b) always induces a higher or equal network spectral efficiency than the game G (a) in the high SNR regime. This counter-intuitive result implies a Braess type paradox, as suggested in the beginning of this subsection.

C. The Case of Large Systems
In this section, we deal with the games G (b) for the case of large networks, i.e., networks with a large number of transmitters. Within this scenario, the dominant parameter to analyze these games is the fraction of transmitters using a particular channel. As we shall see, contrary to the case of small number of transmitters and channels analyzed in the previous section, in the case of large networks, each player becomes indifferent to the action adopted by each of the other players. Here, each player is rather concerned with the fractions of players simultaneously playing the same action, i.e., using the same channel. Hence, one of the interesting issues to be solved is the determination of the repartition of the users between the different channels at the NE. As a first step towards identifying the fractions of transmitters per channel at the NE, we first re-write the potential (9) as a function of the vector x(p) = (x 1 (p), . . . , x S (p)), where x s (p), with s ∈ S, denotes the fraction of players transmitting over channel s given the action profile p ∈ P (b) . Hence, where K s (p) ⊆ K is the set of players using channel s given the action profile p ∈ P (b) , i.e., K s (p) = {k ∈ K : p k,s = 0}. Let b s = Bs B denote the fraction of bandwidth associated with channel s, such that S s=1 b s = 1. Then, one can write the potential as follows Note that the term S log 2 (K) in (23) does not depend on the actions of the players. Thus, in the following, we drop it for the sake of simplicity. We assume that the number of players K and the available bandwidth B grows to infinite at a constant rate µ > 0, while the fractions b s , for all s ∈ S are kept invariant. That is, the average bandwidth per transmitters is asymptotically constant, Thus, under the assumption of large number of transmitters and for any action profile p ∈ P (b) , it follows that, where F gs is the cumulative probability function associated with the channel gains over dimension s. Hence, for all action profile p ∈ P (b) adopted by the players, maximizing the function φ (p) in the asymptotic regime reduces to maximize the functionφ (x(p)), That is, solving the OP, The optimization problem above has a unique solution of the form, where β k is Lagrangian multiplier to satisfy the optimization constraints. Interestingly, in the case when all the channels are described with the same statistics, that is, ∀s ∈ S, F gs (λ) = F g (λ), (∀s ∈ S, Ω s = Ω) it holds that, The above provides a very simple relation between the repartition of the users among the available channels in the asymptotic regime. Indeed, it can be implied that the number of transmitters using a given channel s is proportional to the bandwidth allocated to the corresponding channel. In particular, note that this result generalizes the work in [36].
To conclude on the usefulness of the large system analysis, let us consider the upper bound on the number of NE which is given by Proposition 1. Let us normalize the upper bound on the number of pure NE L in (13) by the total number of pure (channel selection) strategy profiles, and let us write, Now, for a sufficiently large number K, the following approximation holds, Although the number of pure NE in the channel selection game might be conjectured to be large, it is in fact relatively small in the asymptotic regime. Indeed, (28) indicates that when the number of users is large, the fraction of pure NE goes to zero whenever the number of channels is greater or equal to 3. This result shows the difficulty of using methodologies such as the one proposed in Sec. III-C3 to study the set of NE or the difficulty of achieving equilibria using decentralized learning algorithms as proposed in [7], [8].

D. Price of Anarchy and Price of Stability
The price of anarchy (PoA) [37] and the price of stability (PoS) 1 [38] are both measures of the efficiency of the set of equilibria of a game. Basically, the PoA measures the loss of global performance due to decentralization by comparing the maximum sum utility achieved under the global control of a central authority with the minimum sum utility achieved at the Nash equilibrium. The PoS measures also the loss of global performance due to decentralization by comparing the maximum sum utility achieved under the global control of an authority with the maximum sum utility achieved at the Nash equilibrium. For the power allocation game G (a) and the channel selection game G (b) , the PoA and the PoS can be written as follows, and respectively. Here, i ∈ {a, b}, U (i) is defined in (15) and P (i) NE is the set of NE of the game G (i) . Regarding the optimization problem in the numerator of (29) and (30), we have that the following holds from the information theoretical upper bound of the sum of individual rates of the multiple access channel [1]: Here, (a) holds with strict equality, for any given power allocation vector p, when the receiver implements (perfect) successive interference cancellation (SIC). Moreover, (b) holds with strict equality when (perfect) SIC is used at the receiver and p ‡ is the power allocation vector at the NE with the highest NSE. That is, where, the equality in (35) holds since the maximizers of the function φ are the set of NE as shown in Sec. III.
Regarding the optimization problem in the denominator of (29) and (30), we use the following notation and we write (29) and (30) as follows, and PoS respectively. Now, using the fact that, for all p ∈ P (a) , we write (29) and (30) as follows, and PoS Finally, we highlight that, for all k ∈ K and for all p ∈ P (a) (and thus, for all p ∈ P (b) ), we have that, Here, strict equality holds for all k ∈ K, only when transmitters do not share the same channels with other transmitters. In the following, we use this reasoning to study the PoA and the PoS of both games G (a) and G (b) . 1) PoA and PoS in G (a) : As shown in Theorem 1, the set of NE of the game G (a) is unitary. Thus, we have that, and thus, Following Prop. 2, it becomes clear that strict equality in (42) is observed at the equilibrium of the game G (a) , if and only if, transmitters use different channels to communicate with the receiver. In the case in which K = 2 and S = 2, according to Prop. 2, such condition is fulfilled when g = (g 11 , g 12 , g 21 , g 22 ) satisfies either g ∈ A 1 or g ∈ A 4 . This observation leads us to the following Lemma. Lemma 5 (PoA and PoS of G (a) ): Let K = 2, S = 2 and g = (g 11 , g 12 , g 21 , g 22 ) satisfy at least one of the following conditions: g ∈ g ∈ R 4 + : with strict inequality. From Lemma 5, the following corollaries follow by taking the limits SNR → 0 and SNR → ∞, respectively.
Corollary 1 (PoA in the low SNR regime): Let K = 2, S = 2 and g = (g 11 , g 12 , g 21 , g 22 ) satisfy at least one of the following conditions: g 11 g 12 and g 21 g 22 or (49) g 11 g 12 and g 21 g 22 . (50) Then, in the low SNR regime SNR → 0 , with > 0 arbitrarily small. Corollary 2 (PoA in the high SNR regime): Let K = 2, S = 2 and g = (g 11 , g 12 , g 21 , g 22 ) satisfy at least one of the following conditions: g 22 g 12 and g 21 g 11 or (53) g 11 g 21 and g 12 g 22 . (54) Then, in the high SNR regime, we have that SNR → ∞ , In a more general case, for instance K > 2 and S > 2, we state the following result: Proposition 6 (PoA of the G (a) ): Let p * ∈ P (a) be the equilibrium of the game G (a) and consider the following condition: Then, if the condition above holds, we have that: otherwise, we have that: Note that from Prop. 6, it can be concluded that in the case in which K > S, the PoA is strictly bigger than one, since the condition (57) does not hold. Thus, as long as K > S there always exists a loss in performance due to the decentralization of the network. Nonetheless, depending on the channel realizations, in the case in which K S, global optimal performance can be achieved at the equilibrium.
2) PoA and PoS in G (b) : As shown in Theorem 1, the set of NE of the game G (a) is not necessarily unitary. Thus, we have that if the equilibrium of the game G (a) is not unique, then p ( ,a) = p (⊥,a) and the following holds: with strict inequality for any channel realization in (61). This is basically because two different NE action profiles generate the same sum utility with probability zero, when the channel gains are generated following a continuous distribution. Thus, the numerator is monotonically increasing while the denominator is monotonically decreasing in (40). On the contrary, in the case of the PoS (62), equality can be observed whenever p ( ‡,b) = p ( ,b) and (33) holds with equality, which is the case when there exists an equilibrium where every transmitter uses a different channel from all the other transmitters. Following the same arguments as in the case of the game G (a) , we state that a unitary PoA (PoA = 1) is observed only when the set of NE is unitary and transmitters do not share the same channels to transmit. This condition according with Prop. 3, is observed in the game G (b) , with K = 2 and S = 2, when g = (g 11 , g 12 , g 21 , g 22 ) satisfies that g ∈ {B 1 ∪ B 4 } \ B 5 . This observation leads us to the following Lemma.
In the case of the PoS, we highlight that strict equality holds in (42) when transmitters use different channels to communicate with the receiver at the equilibrium. This condition is satisfied in the game G (b) , with K = 2 and S = 2, when g = (g 11 , g 12 , g 21 , g 22 ) satisfies either g ∈ B 1 or g ∈ B 4 . Thus, we write the following Lemma. Lemma 7 (PoS of the game G (b) ): Let K = 2, S = 2 and g = (g 11 , g 12 , g 21 , g 22 ) satisfy at least one of the following conditions: g ∈ g ∈ R 4 + : g ∈ g ∈ R 4 + : with strict inequality. From Lemma 6 and Lemma 7, the following corollaries follow by taking the limits SNR → 0 and SNR → ∞, respectively.
Corollary 3 (PoA and PoS in the low SNR regime): Let K = 2, S = 2 and g = (g 11 , g 12 , g 21 , g 22 ) satisfy at least one of the following conditions: g 11 g 12 and g 21 g 22 or (73) g 11 g 12 and g 21 g 22 . (74) Then, in the low SNR regime SNR → 0 , otherwise, with > 0 arbitrarily small. Corollary 4 (PoA and PoS in the high SNR regime): Let K = 2, S = 2. Then, in the high SNR regime SNR → ∞ , we have that In Corollary 4, (78) follows from the fact that at high SNR, the game G (b) , with K = 2 and S = 2, always possesses two equilibria in pure strategies (Lemma 8). Thus, at the high SNR regime, the numerator of (29) arbitrarily increases while its denominator arbitrarily decreases. Similarly, at the high SNR regime both equilibria consist in action profiles where transmitters use different channels to communicate with the receiver. Thus, (42) holds with strict equality for the case of the NE with the highest NSE p , which justifies (79). In a more general case, for instance K > 2 and S > 2, we state the following result: Proposition 7 (PoA of the G (b) ): Let p * ∈ P (b) be an equilibrium of the game G (b) and consider the following conditions: If ∃(k, s) ∈ K × S : p * k,s > 0, then ∀j ∈ K \ {k}, p * j,s = 0.
Then, if both conditions simultaneously hold, we have that: otherwise, we have that: Proposition 8 (PoS of the G (b) ): Let p * ∈ P (b) be the equilibrium with the highest NSE of the game G (b) and consider the following condition: Then, if the condition above holds, we have that: otherwise, we have that: Note that from Prop. 7, it can be concluded that in the case in which K > S, the PoA and the PoS are both strictly bigger than one, since the condition (85) does not hold. Thus, as in the previous case, as long as K > S there always exists a loss in performance due to the decentralization of the network. Nonetheless, depending on the channel realizations, in the case in which K S, global optimal performance can be achieved at the equilibrium.

V. NUMERICAL EXAMPLES
In the previous sections, a mathematical argument has been provided to show that at the low and high SNR regimes, using a channel selection policy yields a higher or equal NSE than using a water-filling power allocation policy. A formal proof has been provided for the case of K = 2 transmitters and S = 2 channels. Moreover, we highlight that a CS policy is evidently simpler than a PA policy in terms of implementation. Unfortunately, providing a formal proof for an arbitrary number of transmitters K and channels S at a finite SNR becomes a hard task since it will require to calculate all the types of NE depending on the exact channel realizations. Hence, for the case of arbitrary parameters K, S, and SNR, we provide only numerical examples to give an insight of the general behavior. First, we evaluate the impact of the SNR for a network with a fixed number of transmitters and channels. Second, we evaluate the impact of the network load, i.e., the number of transmitters per channel for a given fixed SNR.   A. Impact of the SNR pmax σ 2 In Fig. 5, we plot the network spectral efficiency as a function of the average SNR of the transmitters. Here, it is shown that in fully-loaded and over-loaded networks, i.e., η = K S 1, the gain in NSE obtained by using a discrete action set (game G (a) ) increases with the SNR. Conversely, for weakly loaded networks η < 1, limiting the transmitters to use a single channel appears to be suboptimal as the SNR increases. This is basically because using only one channel, necessarily implies letting some interference-free channels unused. Interestingly, at low SNR, the NSE observed in both games is the same, independently of the load of the system. In both cases, high SNR and low SNR regime, the observed results are in line with Proposition 4 and Proposition 5.
In Fig. 6, we plot the probability of observing a specific number of NE in the game G (b) for different values of SNR. This probability is calculated as the empirical frequency of the number of NE observed in 10 6 realizations of the game G (a) and G (b) . At each game realization, a new channel matrix realization H is considered. In the first case ( Fig. 6 (a)), we consider S = 2 and K = 3, whereas in the second case ( Fig. 6 (b)), K = 3 and S = 3. Note that from Proposition 1, the maximum number of NE is 4 and 7, respectively. However, only 3 and 6 NE are respectively observed in the simulations. This observation Game G (b) . SN R = 5 dB.
Game G (a) . SN R = 10 dB. joints the discussion on the tightness of the bound presented in Sec. III-C2. Note that Proposition 1 relies only on the number of transmitters and available channels. A tighter bound can be obtained if the actual channel realizations are considered. However, this might be significantly tedious for networks with large number of transmitters. Moreover, note also that low SNR levels are associated with a unique NE (with high probability), whereas, high SNR levels are associated with multiple NE (with high probability). Note that this observation, at least for the case of K = 2 and S = 2, is inline with Proposition 4 and Proposition 5.

B. Impact of the Number of Transmitters (K)
In Fig. 7, we plot the NSE as a function of the number of transmitters per channel, i.e., the system load η = K S . Therein, one can observe that for weakly loaded systems η < 1, playing G (a) always leads to higher NSE than playing G (b) . This is natural since restricting the transmitters to use only one channel implies not using other channels which are interference-free, as S > K. On the contrary, for fully-loaded and over-loaded systems, the NSE of the game G (a) is at least equal or better than that of the game G (b) . Indeed, the fact that for high system loads η > 2, the NSE obtained by playing the game G (a) and G (b) become identical stems from the fact that under this condition the system becomes dominated by the interference. In Fig. 8, we plot the PoA (29) of both games G (a) and G (b) as a function of the number of transmitters for several SNR values. First, we highlight the fact that as shown in our theoretical analysis, optimal performance (PoA(G (b) ) = 1) is achieved in the case of low density networks η 1 using channel selection. Note also that in the case of the power allocation game PoA(G (a) ) > 1 independently of the network load, which implies that there always exists a loss of performance when the network is decentralized and the transmitters are allowed to use several channels simultaneously.
Finally, in Fig. 9, we show the fractions x s of transmitters using channel s, with s ∈ S, obtained by Monte-Carlo simulations and using (26) for a large network with an asymptotic ratio of players per channel equivalent to η = 10. Therein, it becomes clear that (26) is a precise estimation of the outcome of the games G (a) and G (b) in the regime of large number of players.

VI. CONCLUSIONS
In this paper, it is shown to what extent the equilibrium analysis of the decentralized parallel MAC differs from those conducted for other channels like Gaussian MIMO interference channels and fast fading MIMO MAC. In particular, the special structure of parallel MAC and the assumption of singleuser decoding at the receiver leads to the potential game property. The channel selection game was merely introduced in the literature but not investigated in details as it is in this paper. In particular, a graph-theoretic interpretation is used to characterize the number of NE. In the case where the number of transmitters is large, the fraction between pure NE and the total number of action profiles is relatively small, which makes both the analysis and the achievability of the NE a challenging task. Now, from a design point of view, we provide theoretical results and numerical examples to show that a fully loaded network, when transmitters use only one channel, can be more efficient than its counterpart when all the channels can be exploited by the transmitters. Although all of these results are encouraging about the relevance of game-theoretic analyses of power allocation problems, important practical issues have been deliberately ignored. For example, the impact of channel estimation is not assessed at all. Also, it is important to conduct a detailed analysis on the signaling cost involved by all the power allocation algorithms arising from this game formulations to learn NE. APPENDIX A PROOF OF PROPOSITION 1 In this appendix, we provide a proof of Proposition 1, which establishes an upper bound for the number of NE of the game G (b) . Here, we exploit some basic tools from graph theory. Let us index the elements of the action set P (b) in any given order using the index n ∈ I = 1, . . . , S K . Denote by p (n) the n-th element of the action set P (b) . We write each vector p (n) with n ∈ I, as p (n) = p j . Consider that each action profile p (n) is associated with a vertex v n in a given non-directed graph G. Each vertex v n is adjacent to the K(S − 1) vertices associated with the action profiles resulting when only one player deviates from the action profile p (n) , i.e., if two vertices v n and v m , with (n, m) ∈ I 2 and n = m, are adjacent, then there exists one and only one k ∈ K, such that More precisely, the graph G can be defined by the pair G = (V, A), where the set V = {v 1 , . . . , v S K } (nodes) represents the S K possible actions profiles of the game and A (edges) is a symmetric matrix (adjacency matrix of G) with dimensions S K × S K and entries defined as follows ∀(n, m) ∈ I 2 and n = m, a n,m = a m,n = 1 if n ∈ V m 0 otherwise , and a n,n = 0 for all n ∈ I, where the set V n is the set of indices of the adjacent vertices of vertex v n .
In the following, we use the concept of distance between two vertices of the graph G. We define this concept using our notation: Definition 4 (Shortest Path): The distance (shortest path) between vertices v n and v m , with (n, m) ∈ I 2 in a given non-directed graph G = (V, A), denoted by d n,m (G) ∈ N is: Here, for any pair of action profiles p (n) and p (m) , with (n, m) ∈ I 2 and n = m, we have that φ(p (n) ) = φ(p (m) ) with probability one. This is because channel gains are random variables drawn from continuous probability distributions and thus, Pr φ(p (n) ) = φ(p (m) ) | n = m = 0. Hence, following Def. 1, one can state that if the action profile p (n) , with n ∈ I, is an NE of the game G (b) , then, it follows that and thus, with probability one, none on the action profiles in V (n) are NE. By iteratively following this procedure over the remaining set of action profiles I \ {n ∪ V (n) }, some action profiles can be eliminated and only those that are potentially NE are left over. Thus, given that the action profile p (n) is an NE, the action profile p (m) , with n = m, can be an NE candidate, if it is (at least) at distance two of p (n) and any other NE candidate, i.e., d n,m (G) = d m,n (G) ∈ {2, 4, . . . ,K}. An action profile at distance ∈ {2, 4, . . . ,K} from p (n) , is a vector where players have simultaneously deviated from p (n) . Hence, for each -tuple of players, there always exists S − 1 action profiles at distance from p (n) and at distance 2 from each other. Thus, considering the initial NE action profile p (n) , there might exist at most NE candidates. This establishes an upper bound for L and completes the proof.
APPENDIX B PROOF OF PROPOSITION 2 In this appendix, we provide a proof for the Proposition 2. The proof is separated in two steps. First, we show that a power allocation vector p = (p 1 , p 2 ) ∈ P (a) of the form is not an NE of the game G (a) , when p 11 ∈ ]0, p max [ and p 22 ∈ ]0, p max [. Second, we show that if p is an NE, then, p is unique and satisfies that, p ∈ P † , where In the following, we use the notation −c to denote the element other than c in the binary set C. First Step: Assume that the action profile p = (p 1 , p 2 ), with p 1 = (p 11 , p 12 ) and p 2 = (p 21 , p 22 ) is an NE of the game G (a) , and assume that for all (k, s) ∈ K × S, p k,s > 0, with strict inequality. Then, from the best response correspondence, it holds that ∀(k, s) ∈ K × S, with β k a Langrangian multiplier chosen to satisfy (2). Then, from 93, it can be implied that ∀k ∈ K, p k,s = 1 β k − σ 2 + p −k,s g −k,s g k,s > 0 and (94) Then, from the fact that ∀k ∈ K, p k,s + p k,−s = p max , we have that, Using a matrix notation, the system of equations (96) can be written in terms of p 11 and p 22 as follows: where, the matrix C is C = 2g 11 g 12 − (g 22 g 11 + g 21 g 12 ) − (g 22 g 11 + g 21 g 12 ) 2g 22 g 21 and, the vector A is Finally, we obtain that if the vector of channels g = (g 11 , g 12 , g 21 , g 22 ) satisfies that min 1 1 + pmax σ 2 (g 12 + g 22 ) , 1 + pmax σ 2 g 21 1 + pmax σ 2 g 12 < α and max 1 + p max σ 2 (g 11 + g 21 ) , that is, then any vector p = (p 1 , p 2 ), with p 1 = (p 11 , p max − p 11 ) ∈ P satisfying the condition (101) is an NE of the game G (a) . Note that infinitely many PA vectors might satisfy (101), which implies infinitely many NE. However, since the channels are realizations of random variables drawn from a continuous distribution, the probability of observing a realization such that g 12 g 21 −g 11 g 22 = 0 is zero. Thus, with probability one, any vector p = (p 1 , p 2 ), with p 1 = (p 11 , p max − p 11 ) and p 2 = (p max − p 22 , p 22 ), such that ∀(k, s) ∈ K × S, 0 < p k,s < p max is not an NE for the game G (a) .

Second
Step: Consider that p † = p † 1 , p † 2 ∈ P (a) is an NE. Then, it must follow that p † ∈ P † , where, where the sets P † n ⊂ P In the following, we identify the conditions over the channel vector g = (g 11 , g 12 , g 21 , g 22 ) such that each p † ∈ P † n , with n ∈ {1, . . . , 8} is an NE. Assume that p † ∈ P † 8 , i.e., p † 1 = (0, p max ) and p † 2 = p max − p † 22 , p † 22 , with p † 22 ∈ ]0, p max [. Then, from (93) with k = 2, we have that: Then, since p † 21 + p † 22 = p max , we have that 1 β 2 = 1 2 p max + σ 2 +pmaxg 12 g 22 + σ 2 g 21 , and thus, where, it must satisfy that 0 < p g 11 0 and Hence, by doing p 12 − p 11 in (110), we obtain that: Then, by replacing (109) in (111), we obtain that the condition (110) are satisfied only if the channels satisfy that: Hence, we can conclude that whenever the vector g = (g 11 , g 12 , g 21 , g 22 ) ∈ A 8 , the NE is of the form (p 11 , p max − p 11 , p max − p 22 , p 22 ), with p 11 = 0 and p 22 = 1 2 p max − σ 2 +g 12 pmax g 22 + σ 2 g 21 . Now, assuming that p † ∈ P † n , with n ∈ {1, . . . , 7}, leads to the conditions of the other types of NE, i.e., the corresponding sets A n , such that whenever g ∈ A n then p † ∈ P † n . It is important to note that, for any particular vector g = (g 11 , g 12 , g 21 , g 22 ) ∈ R 4 , there exists, with probability one, only one set A n which satisfies that g ∈ A n . This is basically because for all (n, m) ∈ {1, . . . , 4} 2 , with n = m, it follows that A n ∩ A m = ∅. Now, for all (n, m) ∈ {5, . . . , 8} 2 , with n = m, it follows that A n ∩ A m ⊂ {g = (g 11 , g 12 , g 21 , g 22 ) ∈ R 4 : g 11 g 22 = g 12 g 21 } and observing a channel realization g, such that, g 11 g 22 = g 12 g 21 is a zero probability event, since all channel gains are drawn from continuous probability distributions. Thus, with probability one, the game G (a) has unique NE. This completes the proof. APPENDIX C PROOF OF PROPOSITION 4 In this appendix, we provide a proof of the Proposition 4. The Proposition 4 basically states that at low SNR regime if an action profile p is a NE of the game G (a) , then it is also a NE of the game G (b) and it is unique. The proof follows from the fact that in the asymptotic regime, i.e., SNR → 0, the set A n and the set B n become identical, when n ∈ {1, . . . , 4}. Moreover, the sets A m , with m ∈ {5, . . . 8} become empty. A n = ∅.
Now, since the sets A 1 , . . . , A 4 or the sets B 1 , . . . , B 4 cover, in the asymptotic regime, all the space of vectors g and both A n and B n determine a unique NE in the game G (b) and G (a) , respectively, it follows that the NE of both games is identical in the asymptotic regime. The uniqueness of the NE in the game G (a) holds with probability one, independently of the SNR level (Proposition 2). In the game G (b) , the NE is not unique if and only if g ∈ A 5 . Nonetheless, since for all (k, s) ∈ K × S, g k,s is a realization of a random variable drawn from a continuous probability distribution, we have that Pr (g ∈ A 5 ) = 0.
Thus, with probability one, the NE of the game G (b) is unique in the low SNR regime, which completes the proof.
APPENDIX D PROOF OF PROPOSITION 5 In this appendix, we provide the proof of Proposition 5, which states that at the high SNR regime there always exists an NE action profile in the game G (b) , which leads to an equal or better global performance than the unique NE of the game G (a) . Before we start, we introduce two lemmas which are used in the proof.
In the following lemma, we describe the set of NE of the game G (b) in the high SNR regime.