Direction Vector-Based Algorithm for the Nash Bargaining Solution in Dynamic Networks
- 주제(키워드) Resource allocation , Nash bargaining solution , direction vector , dynamic networks
- 주제(기타) Telecommunications
- 설명문(일반) [Choi, Jisoo; Park, Hyunggon] Ewha Womans Univ, Dept Elect & Elect Engn, Seoul 03760, South Korea; [Choi, Jisoo] North Carolina State Univ, Dept Elect & Comp Engn, Raleigh, NC 27695 USA
- 등재 SCIE, SCOPUS
- 발행기관 IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- 발행년도 2018
- URI http://www.dcollection.net/handler/ewha/000000151699
- 본문언어 영어
- Published As http://dx.doi.org/10.1109/LCOMM.2018.2819644
초록/요약
It is essential for multiuser networks to determine how to efficiently and fairly allocate shared and limited resources. Moreover, it is critical to optimally allocate these resources while ensuring quality of service requirements for users who require tolerable levels of quality. In this letter, we adopt a game-theoretic approach, referred to as the Nash bargaining solution (NBS), for resource allocation across multiple users. While the NBS can provide a fair and optimal resource allocation, finding the NBS is generally a computationally-intensive task, which becomes even more difficult in dynamic networks. We propose a direction vector-based approach that finds accurate solutions to a bargaining problem with relatively low and consistent complexity requirements. The proposed approach exploits the relationship between the direction vectors of utility functions of each user and is used to reduce the search space of the feasible utility set. The simulation results confirm that the proposed approach can efficiently compute the NBS even for a considerable number of users and resources with better accuracy.
more