Learning to precode in outage minimization games over MIMO interference channels

Elena Veronica Belmega, Hamidou Tembine, Samson Lasaulce

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationConference Record of the 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010
Pages261-266
Number of pages6
DOIs
StatePublished - Dec 1 2010
Event44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010 - Pacific Grove, CA, United States
Duration: Nov 7 2010Nov 10 2010

Other

Other44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010
CountryUnited States
CityPacific Grove, CA
Period11/7/1011/10/10

Fingerprint

MIMO systems
Transceivers
Outages
Reinforcement
Antennas

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Cite this

Belmega, E. V., Tembine, H., & Lasaulce, S. (2010). Learning to precode in outage minimization games over MIMO interference channels. In Conference Record of the 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010 (pp. 261-266). [5757513] https://doi.org/10.1109/ACSSC.2010.5757513

Learning to precode in outage minimization games over MIMO interference channels. / Belmega, Elena Veronica; Tembine, Hamidou; Lasaulce, Samson.

Conference Record of the 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010. 2010. p. 261-266 5757513.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Belmega, EV, Tembine, H & Lasaulce, S 2010, Learning to precode in outage minimization games over MIMO interference channels. in Conference Record of the 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010., 5757513, pp. 261-266, 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010, Pacific Grove, CA, United States, 11/7/10. https://doi.org/10.1109/ACSSC.2010.5757513
Belmega EV, Tembine H, Lasaulce S. Learning to precode in outage minimization games over MIMO interference channels. In Conference Record of the 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010. 2010. p. 261-266. 5757513 https://doi.org/10.1109/ACSSC.2010.5757513
Belmega, Elena Veronica ; Tembine, Hamidou ; Lasaulce, Samson. / Learning to precode in outage minimization games over MIMO interference channels. Conference Record of the 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010. 2010. pp. 261-266
@inproceedings{f90c41e7607648a1b9109a48e528de61,
title = "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.",
author = "Belmega, {Elena Veronica} and Hamidou Tembine and Samson Lasaulce",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/ACSSC.2010.5757513",
language = "English (US)",
isbn = "9781424497218",
pages = "261--266",
booktitle = "Conference Record of the 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010",

}

TY - GEN

T1 - Learning to precode in outage minimization games over MIMO interference channels

AU - Belmega, Elena Veronica

AU - Tembine, Hamidou

AU - Lasaulce, Samson

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79957995336&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79957995336&partnerID=8YFLogxK

U2 - 10.1109/ACSSC.2010.5757513

DO - 10.1109/ACSSC.2010.5757513

M3 - Conference contribution

AN - SCOPUS:79957995336

SN - 9781424497218

SP - 261

EP - 266

BT - Conference Record of the 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010

ER -