| Title |
Efficient Resource Allocation Strategies Based on Nash Bargaining Solution with Linearized Constraints |
| Authors |
최지수(Choi, Jisoo) ; 정승현(Jung, Seunghyun) ; 박형곤(Park, Hyunggon) |
| DOI |
https://doi.org/10.5370/KIEE.2016.65.3.463 |
| Keywords |
Nash bargaining solution ; Resource management ; Piecewise linear ; Convex optimization |
| Abstract |
The overall performance of multiuser systems significantly depends on how effectively and fairly manage resources shared by them. The efficient resource management strategies are even more important for multimedia users since multimedia data is delay-sensitive and massive. In this paper, we focus on resource allocation based on a game-theoretic approach, referred to as Nash bargaining solution (NBS), to provide a quality of service (QoS) guarantee for each user. While the NBS has been known as a fair and optimal resource management strategy, it is challenging to find the NBS efficiently due to the computationally-intensive task. In order to reduce the computation requirements for NBS, we propose an approach that requires significantly low complexity even when networks consist of a large number of users and a large amount of resources. The proposed approach linearizes utility functions of each user and formulates the problem of finding NBS as a convex optimization, leading to nearly-optimal solution with significantly reduced computation complexity. Simulation results confirm the effectiveness of the proposed approach. |