Investigation on GADIA Algorithms for Interference Avoidance: A Game-Theoretic Perspective

In a recent paper (B. Babadi and V. Tarokh, "GADIA: A greedy asynchronous distributed interference avoidance algorithm", IEEE Trans. Inf. Theory, vol. 56, no. 12, pp. 6228-6252, 2010), two asynchronous distributed spectrum allocation algorithms, called the basic GADIA and the soft GADIA respectively, were proposed to solve the problem of interference avoidance for a canonical class of communication networks. The methodology proposed therein is constructive. In this letter, we re-investigate this problem from a game-theoretic perspective, and obtain some key incremental results in favor of the original paper.