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

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 22; no. 7; pp. 1342 - 1345
Main Authors: Choi, Jisoo, Park, Hyunggon
Format: Journal Article
Language:English
Published: IEEE 01.07.2018
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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