View : 40 Download: 0

Coalition based low-complexity algorithm for Nash bargaining solution

Title
Coalition based low-complexity algorithm for Nash bargaining solution
Authors
Choi J.Jung S.Park H.
Ewha Authors
박형곤
SCOPUS Author ID
박형곤scopus
Issue Date
2016
Journal Title
International Conference on Ubiquitous and Future Networks, ICUFN
ISSN
2165-8528JCR Link
Citation
vol. 2016-August, pp. 498 - 500
Keywords
coalition formationcooperative gamesNash bargaining solution (NBS)resource allocation
Publisher
IEEE Computer Society
Indexed
SCOPUS scopus
Abstract
In this paper, we present an efficient algorithm for Nash bargaining solution (NBS). While NBS can be deployed to allocate limited resources to multiple users fairly and optimally, it requires significantly high computational complexity to find NBS, in particular, as the number of users becomes large. In order to reduce the complexity for NBS, we propose to adopt a coalition formation based approach, which is efficient for large number of users. In addition, we define a coalition utility function, which enables better accuracy for resource allocation based on NBS. The simulation results confirm that the proposed approaches can significantly reduce the complexity while achieving better accuracy for resource allocation. © 2016 IEEE.
DOI
10.1109/ICUFN.2016.7537082
ISBN
9781467399913
Appears in Collections:
엘텍공과대학 > 전자공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE