Low complexity iterative multimedia resource allocation based on game theoretic approach

Efficient resource management strategies are important for multiuser multimedia applications, as they are often serviced over resource-constrained and shared network infrastructure. Moreover, an acceptable level of quality e.g., Quality of Service (QoS) should be guaranteed. In this paper, we consider a game-theoretic resource management strategy, where the bargaining solutions are deployed in the resource allocation. We are in particular interested in the Nash Bargaining Solution (NBS) that can allocate resources in a fair and optimal way, while explicitly considering the achieved utility. Finding the NBS, however, is a challenging task due to its potentially high computational complexity, especially when a large number of users and the large amount of resources are available. In order to overcome the problem, we propose an iterative approach that requires significantly lower computational complexity compared to the conventional approach. The proposed approach decomposes the bargaining problem into sub-bargaining problems, where a sub-bargaining problem considers smaller feasible set and computes the corresponding sub-NBS. This step is iteratively repeated for successive sub-bargaining problems until the NBS is obtained. We show that the proposed sub-NBS approaches the NBS with a small error while significantly reducing the complexity required to find the NBS.