Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Spectrum allocation for decentralized transmission strategies: properties of Nash equilibria
EURASIP Journal on Advances in Signal Processing - Special issue on game theory in signal processing and communications
The MIMO iterative waterfilling algorithm
IEEE Transactions on Signal Processing
Competitive optimization of cognitive radio MIMO systems via game theory
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Spectrum sharing games on the interference channel
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Inter-operator spectrum sharing from a game theoretical perspective
EURASIP Journal on Advances in Signal Processing - Special issue on dynamic spectrum access for wireless networking
MIMO cognitive radio: a game theoretical approach
IEEE Transactions on Signal Processing
Spectrum management for interference-limited multiuser communication systems
IEEE Transactions on Information Theory
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A game theoretic approach to multi-user spectrum allocation
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A hierarchical game approach to inter-operator spectrum sharing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
IEEE Transactions on Signal Processing
Game-theoretic approach to joint transmitter adaptation and power control in wireless systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Distributed power allocation in multi-user multi-channel cellular relay networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Signal Processing
A two-users transmission game in OFDM wireless networks with resource cost
MACOM'10 Proceedings of the Third international conference on Multiple access communications
Robust MMSE precoding in MIMO channels with pre-fixed receivers
IEEE Transactions on Signal Processing
Dynamic power allocation games in parallel multiple access channels
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Learning to use the spectrum in self-configuring heterogenous networks: a logit equilibrium approach
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
A game theory distributed approach for energy optimization in WSNs
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 35.76 |
In this two-part paper, we address the problem of finding the optimal precoding/multiplexing scheme for a set of noncooperative links sharing the same physical resources, e.g., time and bandwidth. We consider two alternative optimization problems: P.l) the maximization of mutual information on each link, given constraints on the transmit power and spectral mask; and P.2) the maximization of the transmission rate on each link, using finite-order constellations, under the same constraints as in P.l, plus a constraint on the maximum average error probability on each link. Aiming at finding decentralized strategies, we adopted as optimality criterion the achievement of a Nash equilibrium and thus we formulated both problems P.l and P.2 as strategic noncooperative (matrix-valued) games. In Part I of this two-part paper, after deriving the optimal structure of the linear transceivers for both games, we provided a unified set of sufficient conditions that guarantee the uniqueness of the Nash equilibrium. In this Part II of the paper, we focus on the achievement of the equilibrium and propose alternative distributed iterative algorithms that solve both games. Specifically, the new proposed algorithms are the following: 1) the sequential and simultaneous iterative waterfilling-based algorithms, incorporating spectral mask constraints and 2) the sequential and simultaneous gradient-projection-based algorithms, establishing an interesting link with variational inequality problems. Our main contribution is to provide sufficient conditions for the global convergence of all the proposed algorithms which, although derived under stronger constraints, incorporating for example spectral mask constraints, have a broader validity than the convergence conditions known in the current literature for the sequential iterative waterfilling algorithm.