Robust rate maximization game under bounded channel uncertainty
Amod J.G. Anandkumar
Animashree Anandkumar
Sangarapillai Lambotharan
Jonathon Chambers
2134/9576
https://repository.lboro.ac.uk/articles/Robust_rate_maximization_game_under_bounded_channel_uncertainty/9576224
We consider the problem of decentralized power allocation for competitive rate maximization in a frequency-selective Gaussian interference channel under bounded channel uncertainty. We formulate a distribution-free robust framework for the rate maximization game. We present the robust optimization equilibrium for this game and derive sufficient conditions for its existence and uniqueness. We show that an iterative waterfilling algorithm converges to this equilibrium under certain sufficient conditions. We analyze the social properties of the equilibrium under varying channel uncertainty bounds for the two-user case. We also observe an interesting phenomenon that the equilibrium moves toward a frequency-division multiple-access solution for any set of channel coefficients under increasing channel uncertainty bounds. We further prove that increasing channel uncertainty can lead to a more efficient equilibrium and, hence, a better sum rate in certain two-user communication systems. Finally, we confirm, through simulations, that this improvement in equilibrium efficiency is also observed in systems with a higher number of users.
2012-03-28 10:22:29
Game theory
Nash equilibrium
Rate maximization
Robust games
Waterfilling
CSI uncertainty