CaltechAUTHORS
  A Caltech Library Service

Robust rate-maximization game under bounded channel uncertainty

Anandkumar, Amod J. G. and Anandkumar, Animashree and Lambotharan, Sangarapillai and Chambers, Jonathon (2010) Robust rate-maximization game under bounded channel uncertainty. In: 2010 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE , Piscataway, NJ, pp. 3158-3161. ISBN 978-1-4244-4295-9. https://resolver.caltech.edu/CaltechAUTHORS:20170922-084018628

[img] PDF - Published Version
See Usage Policy.

185Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170922-084018628

Abstract

The problem of decentralized power allocation for competitive rate maximization in a frequency-selective Gaussian interference channel is considered. In the absence of perfect knowledge of channel state information (CSI), a distribution-free robust game is formulated. A robust-optimization equilibrium (RE) is proposed where each player formulates a best response to the worst-case interference. The conditions for existence, uniqueness and convergence of the RE are derived. It is shown that the convergence reduces as the uncertainty increases. Simulations show an interesting phenomenon where the proposed RE moves closer to a Pareto-optimal solution as the CSI uncertainty bound increases, when compared to the classical Nash equilibrium under perfect CSI. Thus, the robust-optimization equilibrium successfully counters bounded channel uncertainty and increases system sum-rate due to users being more conservative about causing interference to other users.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/ICASSP.2010.5496066DOIArticle
http://ieeexplore.ieee.org/document/5496066PublisherArticle
Additional Information:© 2010 IEEE. This work is supported by EPSRC grant EP/F065477/1. The second author is supported in part by ARO Grant W911NF-06-1-0076. We thank Dr. Ishai Menache, MIT for his input on robust game theory and Dr. Gesualdo Scutari, Hong Kong University of Science and Technology for initial guidance and advice on waterfilling algorithms.
Funders:
Funding AgencyGrant Number
Engineering and Physical Sciences Research Council (EPSRC)EP/F065477/1
Army Research Office (ARO)W911NF-06-1-0076
Subject Keywords:Rate maximization, robust games, waterfilling, decentralized power control, Gaussian interference channel
Record Number:CaltechAUTHORS:20170922-084018628
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20170922-084018628
Official Citation:A. J. G. Anandkumar, A. Anandkumar, S. Lambotharan and J. Chambers, "Robust rate-maximization game under bounded channel uncertainty," 2010 IEEE International Conference on Acoustics, Speech and Signal Processing, Dallas, TX, 2010, pp. 3158-3161. doi: 10.1109/ICASSP.2010.5496066 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5496066&isnumber=5494886
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:81732
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:22 Sep 2017 16:22
Last Modified:03 Oct 2019 18:46

Repository Staff Only: item control page