The MIMO iterative waterfilling algorithm
IEEE Transactions on Signal Processing
Conjectural equilibrium in multiuser power control games
IEEE Transactions on Signal Processing
Power allocation games for MIMO multiple access channels with coordination
IEEE Transactions on Wireless Communications
Transmission strategies in MIMO ad hoc networks
EURASIP Journal on Wireless Communications and Networking - Special issue on optimization techniques in wireless communications
Power games in MIMO interference systems
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Competitive optimization of cognitive radio MIMO systems via game theory
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Spectrum sharing games on the interference channel
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Resource allocation in protected and shared bands: uniqueness and efficiency of Nash equilibria
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Monotonic convergence of distributed interference pricing in wireless networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Inter-operator spectrum sharing from a game theoretical perspective
EURASIP Journal on Advances in Signal Processing - Special issue on dynamic spectrum access for wireless networking
MIMO cognitive radio: a game theoretical approach
IEEE Transactions on Signal Processing
Parameterization of the MISO IFC rate region: the case of partial channel state information
IEEE Transactions on Wireless Communications
Distributed MIMO network optimization based on duality and local message passing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Utility-based dynamic resource allocation in multi-user MIMO-OFDMA cellular systems
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
On the rate duality of MIMO interference channel and its application to sum rate maximization
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Exploiting opportunistic multiuser detection in decentralized multiuser MIMO systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Distributed interference pricing for the MIMO interference channel
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Monotonic optimization framework for the two-user MISO interference channel
IEEE Transactions on Communications
Local interference pricing for distributed beamforming in MIMO networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
A survey on game theory applications in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Signal Processing
Multi-cell MIMO cooperative networks: a new look at interference
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
Game theoretic design for polarimetric MIMO radar target detection
Signal Processing
Dynamic power allocation games in parallel multiple access channels
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity
Journal of Global Optimization
Hi-index | 0.09 |
This paper considers the noncooperative maximization of mutual information in the Gaussian interference channel in a fully distributed fashion via game theory. This problem has been studied in a number of papers during the past decade for the case of frequency-selective channels. A variety of conditions guaranteeing the uniqueness of the Nash Equilibrium (NE) and convergence of many different distributed algorithms have been derived. In this paper we provide a unified view of the state-of- the-art results, showing that most of the techniques proposed in the literature to study the game, even though apparently different, can be unified using our recent interpretation of the waterfilling operator as a projection onto a proper polyhedral set. Based on this interpretation, we then provide a mathematical framework, useful to derive a unified set of sufficient conditions guaranteeing the uniqueness of the NE and the global convergence of waterfilling based asynchronous distributed algorithms. The proposed mathematical framework is also instrumental to study the extension of the game to the more general MIMO case, for which only few results are available in the current literature. The resulting algorithm is, similarly to the frequency-selective case, an iterative asynchronous MIMO waterfilling algorithm. The proof of convergence hinges again on the interpretation of the MIMO waterfilling as a matrix projection, which is the natural generalization of our results obtained for the waterfilling mapping in the frequency-selective case.