Bargaining and the MISO Interference Channel

We examine the MISO interference channel under cooperative bargaining theory. Bargaining approaches such as the Nash and Kalai-Smorodinsky solutions have previously been used in wireless networks to strike a balance between max-sum efficiency and max-min equity in users' rates. However, cooperative bargaining for the MISO interference channel has only been studied extensively for the two-user case. We present an algorithm that finds the optimal Kalai-Smorodinsky beamformers for an arbitrary number of users. We also consider joint scheduling and beamformer selection, using gradient ascent to find a stationary point of the Kalai-Smorodinsky objective function. When interference is strong, the flexibility allowed by scheduling compensates for the performance loss due to local optimization. Finally, we explore the benefits of power control, showing that power control provides nontrivial throughput gains when the number of transmitter/receiver pairs is greater than the number of transmit antennas.

[1]  Erik G. Larsson,et al.  Competition Versus Cooperation on the MISO Interference Channel , 2008, IEEE Journal on Selected Areas in Communications.

[2]  Biao Chen,et al.  Achievable Rate Region for Downlink Beamforming in the Presence of Interference , 2007, 2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers.

[3]  E. L. Hahne,et al.  Round-Robin Scheduling for Max-Min Fairness in Data Networks , 1991, IEEE J. Sel. Areas Commun..

[4]  A. Lee Swindlehurst,et al.  Cooperative Power Scheduling for Wireless MIMO Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[5]  Ronald A. Iltis,et al.  Noncooperative iterative MMSE beamforming algorithms for ad hoc networks , 2006, IEEE Transactions on Communications.

[6]  Yang Xiao,et al.  IEEE 802.11n: enhancements for higher throughput in wireless LANs , 2005, IEEE Wireless Communications.

[7]  Rick S. Blum,et al.  Optimized signaling for MIMO interference systems with feedback , 2003, IEEE Trans. Signal Process..

[8]  Eric van Damme,et al.  Non-Cooperative Games , 2000 .

[9]  E. Kalai,et al.  OTHER SOLUTIONS TO NASH'S BARGAINING PROBLEM , 1975 .

[10]  Shalinee Kishore,et al.  Inter-Cell Interference Management in WiMAX Downlinks by A Stackelberg Game between BSs , 2008, 2008 IEEE International Conference on Communications.

[11]  H. Boche,et al.  Fairness vs. Efficiency: Comparison of Game Theoretic Criteria for OFDMA Scheduling , 2007, 2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers.

[12]  Erik G. Larsson,et al.  The MISO interference channel from a game-theoretic perspective: A combination of selfishness and altruism achieves pareto optimality , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[13]  Sergio Barbarossa,et al.  Competitive design of multiuser MIMO interference systems based on game theory: A unified framework , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[14]  Zhu Han,et al.  Fair multiuser channel allocation for OFDMA networks using Nash bargaining solutions and coalitions , 2005, IEEE Transactions on Communications.

[15]  Vikram Srinivasan,et al.  Cooperation in wireless ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[16]  A. Roth.  An impossibility result concerningn-person bargaining games , 1979 .

[17]  Jeffrey G. Andrews,et al.  Fundamentals of WiMAX: Understanding Broadband Wireless Networking (Prentice Hall Communications Engineering and Emerging Technologies Series) , 2007 .

[18]  Yue Rong,et al.  Optimal Power Schedule for Distributed MIMO Links , 2008, IEEE Transactions on Wireless Communications.

[19]  John P. Conley,et al.  The bargaining problem without convexity: extending the egalitarian and Kalai-Smorodinsky solutions , 1991 .

[20]  E. Kalai.  Proportional Solutions to Bargaining Situations: Interpersonal Utility Comparisons , 1977 .

[21]  Erik G. Larsson,et al.  Complete Characterization of the Pareto Boundary for the MISO Interference Channel , 2008, IEEE Transactions on Signal Processing.

[22]  Josef A. Nossek,et al.  Intercell-Interference in the Gaussian MISO Broadcast Channel , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[23]  Josef A. Nossek,et al.  On maximizing the sum network MISO broadcast capacity , 2008, 2008 International ITG Workshop on Smart Antennas.

[24]  William Thomson,et al.  Two characterizations of the Raiffa solution , 1980 .

[25]  H.J.M. Peters,et al.  Individually monotonic bargaining solutions of n-person bargaining games , 1984 .

[26]  Christian Hartmann,et al.  Decentralized inter-cell interference coordination by autonomous spectral reuse decisions , 2008, 2008 14th European Wireless Conference.

[27]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[28]  J. Nash.  THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[29]  Yang Song,et al.  Equilibrium Efficiency Improvement in MIMO Interference Systems: A Decentralized Stream Control Approach , 2007, IEEE Transactions on Wireless Communications.

[30]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[31]  Rene L. Cruz,et al.  Weighted max-min fair beamforming, power control, and scheduling for a MISO downlink , 2008, IEEE Transactions on Wireless Communications.

[32]  Jens Leth Hougaard,et al.  The Kalai-Smorodinsky Solution: A Generalization to Nonconvex n-Person Bargaining , 1998 .

[33]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[34]  Howard Raiffa,et al.  Games And Decisions , 1958 .

[35]  R.C.M.H. Douven,et al.  Properties of N-person axiomatic bargaining solutions if the Pareto frontier is twice differentiable and strictly concave , 1995 .