Bargaining and the MISO Interference Channel

Open Access
Research Article
Part of the following topical collections:
  1. Game Theory in Signal Processing and Communications


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.


Objective Function Wireless Network Nash Stationary Point Local Optimization 

Publisher note

To access the full article, please see PDF.

Copyright information

© M. Nokleby and A. L. Swindlehurst. 2009

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Authors and Affiliations

  1. 1.Department of Electrical and Computer EngineeringRice UniversityHoustonUSA
  2. 2.Department of Electrical Engineering and Computer ScienceUniversity of California at IrvineIrvineUSA

Personalised recommendations