Game theory for precoding in a multi-user system: Bargaining for overall benefits

Gao, Jie; Vorobyov, Sergiy A.; Jiang, Hai

doi:10.1109/icassp.2009.4960095

Cited by 6 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is easy to see that the above utility model is the channel capacity model [15] [17]. The difference is only to divide above utility model by the power and achieve a utility measure of the following form with units of bit(s)/Watt.…”

Section: With Combiningmentioning

confidence: 99%

See 1 more Smart Citation

A cooperative strategy based on Nash bargaining solution under spectral mask constraint in cooperative relay networks

Fallah

Huang

Wang

2011

2011 IEEE 3rd International Conference on Communication Software and Networks

View full text Add to dashboard Cite

Resource allocation among multiple users interference channel has posed significant issues in cooperative communication networks. A game-theoretic approach is studied under spectral mask constraints (SMCs) in cooperative relay networks using Amplify-and-Forward as a relaying protocol. The cooperative strategy employed as game-theoretic approach is based on the Nash bargaining solution (NBS). The Nash equilibrium and Nash bargaining solutions are derived for a two-player game based on the joint time division multiplexing and frequency division multiplexing (TDM/FDM) as a mode of cooperation.The condition for the uniqueness and existence of the NBS is derived.

show abstract

Section: With Combiningmentioning

confidence: 99%

“…Because of the symmetry of the network, (12) and (13) can also be applied to U2 as (15) Note that (15) indicates no combining is applied at the destination.…”

Section: With Combiningmentioning

confidence: 99%

A cooperative strategy based on Nash bargaining solution under spectral mask constraint in cooperative relay networks

Fallah

Huang

Wang

2011

2011 IEEE 3rd International Conference on Communication Software and Networks

View full text Add to dashboard Cite

show abstract

“…Theorem 4 can be used to further simplify the lower level problem (23). Substituting (21) into the objective function of the sub-problem (23), the latter can be rewritten as…”

Section: Distributed Algorithm For Finding the Nb Solutionmentioning

confidence: 99%

“…Some preliminary results without proofs have been reported in[22],[23], and submitted[24].October 29, 2018 DRAFT…”

mentioning

confidence: 99%

Cooperative Resource Allocation Games Under Spectral Mask and Total Power Constraints

Gao

Vorobyov

Jiang

2010

IEEE Trans. Signal Process.

Self Cite

View full text Add to dashboard Cite

The use of orthogonal signaling schemes such as time-, frequency-, or code-division multiplexing (T-, F-, CDM) in multi-user systems allows for power-efficient simple receivers. It is shown in this paper that by using orthogonal signaling on frequency selective fading channels, the cooperative Nash bargaining (NB)-based precoding games for multi-user systems, which aim at maximizing the information rates of all users, are simplified to the corresponding cooperative resource allocation games. The latter provides additional practically desired simplifications to transmitter design and significantly reduces the overhead during user cooperation. The complexity of the corresponding precoding/resource allocation games, however, depends on the constraints imposed on the users. If only spectral mask constraints are present, the corresponding cooperative NB problem can be formulated as a convex optimization problem and solved efficiently in a distributed manner using dual decomposition based algorithm.However, the NB problem is non-convex if total power constraints are also imposed on the users.In this case, the complexity associate with finding the NB solution is unacceptably high. Therefore, the multi-user systems are categorized into bandwidth-and power-dominant based on a bottleneck resource, and different manners of cooperation are developed for each type of systems for the case of two-users.Such classification guarantees that the solution obtained in each case is Pareto-optimal and actually can be identical to the optimal solution, while the complexity is significantly reduced. Simulation results demonstrate the efficiency of the proposed cooperative precoding/resource allocation strategies and the reduced complexity of the proposed algorithms.

show abstract

“…Scutari et al analyzed the existence and performance of Nash equilibrium solution [13] and developed an algorithm for computing the beamforming vectors in a non-cooperative multiuser game [14]. To obtain more efficient beamforming vectors, cooperative Nash bargaining solutions for overall benefits were presented in [15], [16].…”

Section: Introductionmentioning

confidence: 99%

Non-Cooperative Game for Equal-Gain Beamforming in Multiuser OFDM Systems

Juang

Ting

et al. 2010

2010 IEEE 72nd Vehicular Technology Conference - Fall

View full text Add to dashboard Cite

Spatial division multiple access can be used to boost spectrum efficiency if perfect channel information is available at the transmitter. By using equal-gain beamforming, this paper reformulates the difficult non-convex optimization problem of finding the optimal multiuser beamforming vectors into a convex one. Consequently, the Nash equilibrium solution can be reached based on a non-cooperative game, where each receiver feedbacks its selected beamforming vector without sharing information with the others. This paper verifies the performance over spatial correlated, multipath, time-varying Rayleigh fading channels for downlink orthogonal frequency division multiplexing systems. Based on long-term beamforming, the proposed algorithm outperforms the conventional approach in terms of received SINR, besides the reduced complexity.

show abstract

Game theory for precoding in a multi-user system: Bargaining for overall benefits

Cited by 6 publications

References 14 publications

A cooperative strategy based on Nash bargaining solution under spectral mask constraint in cooperative relay networks

A cooperative strategy based on Nash bargaining solution under spectral mask constraint in cooperative relay networks

Cooperative Resource Allocation Games Under Spectral Mask and Total Power Constraints

Non-Cooperative Game for Equal-Gain Beamforming in Multiuser OFDM Systems

Contact Info

Product

Resources

About