A game theory perspective on interference avoidance

We show that the fixed power, synchronous interference avoidance (IA) scheme of (C. Rose et al, IEEE Trans. on Wireless Comm., vol.1, no.3, p. 415-427, 2002) employing the (greedy) eigen-iteration can be modeled as the recently developed potential game of (D. Monderer et al, Journal of Games and Economic Behavior, vol.14, no.0044, p.124-143, 1996). Motivated by the fact that receivers can make small mistakes, we consider the convergence of the eigen-iteration when noise is added in a manner similar to (P. Anigstein, IEEE Trans. On Inf. Theory vol.49, no.4, 2003). Further, we restrict ourselves to a class of signal environments that we call levelable environments. Applying game-theory, we obtain a convergence result similar to that of the Anigstein method, for levelable environments: arbitrarily small noise assures that the eigen-iteration almost surely converges to a neighborhood of the optimum signature set.