Cooperative game theory and the Gaussian interference channel

TL;DR

This paper applies cooperative game theory to interference channels, extending previous work to multiple players and frequency-selective channels, and provides efficient algorithms and simulations for computing the Nash bargaining solution.

Contribution

It introduces new methods for analyzing interference channels with multiple players, including convex optimization approaches and an efficient algorithm for two-player frequency-selective channels.

Findings

Nash bargaining solutions can be computed via convex optimization.

The paper provides an $O(K \log_2 K)$ algorithm for two-player frequency-selective channels.

Simulation results validate the proposed methods.

Abstract

In this paper we discuss the use of cooperative game theory for analyzing interference channels. We extend our previous work, to games with N players as well as frequency selective channels and joint TDM/FDM strategies. We show that the Nash bargaining solution can be computed using convex optimization techniques. We also show that the same results are applicable to interference channels where only statistical knowledge of the channel is available. Moreover, for the special case of two players $2\times K$ frequency selective channel (with K frequency bins) we provide an $O(K \log_2 K)$ complexity algorithm for computing the Nash bargaining solution under mask constraint and using joint FDM/TDM strategies. Simulation results are also provided.