Algorithms for stochastic games on interference channels

We consider a wireless channel shared by multiple transmitter-receiver pairs. Their transmissions interfere with each other. Each transmitter-receiver pair aims to maximize its long-term average transmission rate subject to an average power constraint. This scenario is modeled as a stochastic game. We then formulate the problem of finding a Nash equilibrium (NE) as an affine variational inequality (VI) problem, and present an algorithm to solve the VI. We provide sufficient conditions for uniqueness of the NE and convergence of the algorithm which are much weaker than the sufficient conditions available in literature. We also provide a distributed algorithm to compute Pareto optimal solutions for the proposed game.