Computing The Nash Bargaining Solution for the 2X2 Frequency Selective Interference Channel

Abstract

In this paper we extend our previous work analyzing the interference channel as a conflict situation to frequency selective channels and joint TDM/FDM strategies. We provide an O(K log K) complexity algorithm for computing the Nash bargaining solution under mask constraint for the 2times2 frequency selective interference channel (with K frequency bins) under joint FDM/TDM strategies. Simulation results are also provided. We also show the convexity of the N players game with similar strategies.