Power Allocation Games on Interference Channels with Complete and Partial Information
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 under different assumptions. We first assume that each transmitter and receiver has knowledge of all direct and cross link channel gains. We later relax the assumption to the knowledge of incident channel gains and then further relax to the knowledge of the direct link channel gains only. In all the cases, we formulate the problem of finding the Nash equilibrium as a variational inequality (VI) problem and present an algorithm to solve the VI.
Cite
@article{arxiv.1501.04412,
title = {Power Allocation Games on Interference Channels with Complete and Partial Information},
author = {Krishna Chaitanya A and Utpal Muherji and Vinod Sharma},
journal= {arXiv preprint arXiv:1501.04412},
year = {2015}
}
Comments
arXiv admin note: text overlap with arXiv:1409.7551