The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Competitive Design of Multiuser MIMO Systems Based on Game Theory: A Unified View
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Cognitive radio: brain-empowered wireless communications
Haykin, S. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.839380 · Cited by 11,916
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Switching in Systems and Control
Liberzon, D. (2003) · Systems & Control: Foundations & Applications · doi:10.1007/978-1-4612-0017-8 · Cited by 7,023
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
(1994) · Cited by 5,513
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
Cited by
Multi-Cell MIMO Cooperative Networks: A New Look at Interference
Gesbert, D., Hanly, S., Huang, H., Shamai Shitz, S., Simeone, O., & Yu, W. (2010) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2010.101202 · Cited by 1,760
Foundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
Convex Optimization, Game Theory, and Variational Inequality Theory
Scutari, G., Palomar, D., Facchinei, F., & Pang, J.-S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936021 · Cited by 376
Self-citationDynamic Resource Allocation in Cognitive Radio Networks
Zhang, R., Liang, Y.-C., & Cui, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936022 · Cited by 358
Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
Scutari, G., Facchinei, F., Song, P., Palomar, D. P., & Pang, J.-S. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2293126 · Cited by 338
Self-citationOptimal Resource Allocation for MIMO Ad Hoc Cognitive Radio Networks
Kim, S.-J., & Giannakis, G. B. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2120270 · Cited by 301
Game Theory for Multi-Access Edge Computing: Survey, Use Cases, and Future Trends
Moura, J., & Hutchison, D. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2863030 · Cited by 193
Metadata
- Authors
- Scutari, G., Palomar, D., & Barbarossa, S.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2008-09
- Volume
- 26
- Issue
- 7
- Pages
- 1089-1103
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2112996088
- Cited by
- 265
- References
- 31
- FWCI
- 29.29
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.