Direction Vector-Based Algorithm for the Nash Bargaining Solution in Dynamic Networks

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 22; číslo 7; s. 1342 - 1345
Hlavní autoři: Choi, Jisoo, Park, Hyunggon
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.07.2018
Témata:
Computational complexity
direction vector
dynamic networks
Dynamic scheduling
Heuristic algorithms
Nash bargaining solution
NIST
Quality of service
Resource allocation
Resource management
ISSN:1089-7798, 1558-2558
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2018.2819644