A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Convex Optimization
Analysis of iterative waterfilling algorithm for multiuser power control in digital subscriber lines
EURASIP Journal on Applied Signal Processing
Game theory for precoding in a multi-user system: Bargaining for overall benefits
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Power allocation games for MIMO multiple access channels with coordination
IEEE Transactions on Wireless Communications
Nash bargaining and proportional fairness for wireless systems
IEEE/ACM Transactions on Networking (TON)
Bargaining over the interference channel with total power constraints
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
Nash bargaining over MIMO interference systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Complete Characterization of the Pareto Boundary for the MISO Interference Channel
IEEE Transactions on Signal Processing - Part II
Competitive spectrum sharing in cognitive radio networks: a dynamic game approach
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Distributed multiuser power control for digital subscriber lines
IEEE Journal on Selected Areas in Communications
Competition Versus Cooperation on the MISO Interference Channel
IEEE Journal on Selected Areas in Communications
Cooperative Game Theory and the Gaussian Interference Channel
IEEE Journal on Selected Areas in Communications
Hi-index | 35.68 |
Resource allocation problems in multi-user systems, modeled as Nash bargaining (NB) cooperative games, are investigated under different constraints. Using the joint time division multiplexing and frequency division multiplexing (TDM/FDM) scheme as a manner of cooperation in the NB resource allocation game with only spectrum mask constraints (SMCs), it is shown that the efficiency of the corresponding solution depends on both the interference-to-signal and interference-to-noise ratios of the users. Sufficient conditions under which the joint TDM/FDM based NB solution outperforms a noncooperative Nash equilibrium solution are derived and shown to be mild. A semi-distributed algorithm is proposed for finding the NB solution of the corresponding game with SMCs only. The NB based resource allocation game with both SMCs and total power constraints (TPCs) is shown to be a nonconvex optimization problem of high complexity. For such a game, a classification of two-user systems into bandwidth- and power-dominant systems is proposed based on the concept of Pareto-optimality. This classification gives insights to the resource allocation problem by showing that the benefits of both users are guaranteed to increase simultaneously only when the dominant resource in the system increases. Using this classification, efficient suboptimal algorithms of low complexity are derived based on the idea of optimally allocating the dominant resource and suboptimally allocating the other resource. Simulation results demonstrate the efficiency of the proposed cooperative NB resource allocation strategies.