Algorithms for Stochastic Games on Interference Channels

Chaitanya, Krishna A and Mukherji, Utpal and Sharma, Vinod (2015) Algorithms for Stochastic Games on Interference Channels. In: 21st National Conference on Communications (NCC), FEB 27-MAR 01, 2015, Indian Inst Technol, Bombay, INDIA.

PDF Twe_Fir_Nat_Con_Com_2015.pdf - Published Version Restricted to Registered users only Download (157kB) | Request a copy

Abstract

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.

Item Type:	Conference Proceedings
Series.:	National Conference on Communications NCC
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	30 Aug 2016 10:19
Last Modified:	30 Aug 2016 10:19
URI:	http://eprints.iisc.ac.in/id/eprint/54561

Actions (login required)

View Item