Robust rate-maximization game under bounded channel uncertainty
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.
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.Attached Files
Published - 05496066.pdf
Files
Name | Size | Download all |
---|---|---|
md5:8b0915e570136624af9316a3aa606ec8
|
190.4 kB | Preview Download |
Additional details
- Eprint ID
- 81732
- Resolver ID
- CaltechAUTHORS:20170922-084018628
- Engineering and Physical Sciences Research Council (EPSRC)
- EP/F065477/1
- Army Research Office (ARO)
- W911NF-06-1-0076
- Created
-
2017-09-22Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field