Skip to Main content Skip to Navigation
Conference papers

Learning to precode in outage minimization games over MIMO interference channels

Abstract : In this paper, we consider a network composed of several interfering transmitter-receiver pairs where all the terminals are equipped with multiple antennas. The problem of finding the precoding matrices minimizing the outage probabilities is analyzed using a game theoretical framework under the assumption of slow fading links and non-cooperative transmissions. An analytical solution of this game is very difficult to be found in general. Even in the most simple case of single-user, the problem remains an open issue. However, the existence of a pure-strategy Nash equilibrium solution is proven in the extreme SNR regimes. Furthermore, we exploit a simple reinforcement algorithm and show that, based only on the knowledge of one ACK/NACK bit, the users may converge to an Nash equilibrium solution of the game under investigation.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download
Contributor : Elena Veronica Belmega <>
Submitted on : Wednesday, January 12, 2011 - 9:31:41 AM
Last modification on : Wednesday, April 8, 2020 - 3:20:13 PM
Document(s) archivé(s) le : Wednesday, April 13, 2011 - 2:38:12 AM


Files produced by the author(s)


  • HAL Id : hal-00555035, version 1


Elena Veronica Belmega, Hamidou Tembine, Samson Lasaulce. Learning to precode in outage minimization games over MIMO interference channels. The Asilomar Conference on Signals, Systems, and Computers, Jan 2011, United States. pp.1-6. ⟨hal-00555035⟩



Record views


Files downloads