Coalition based low-complexity algorithm for Nash bargaining solution
- 주제(키워드) coalition formation , cooperative games , Nash bargaining solution (NBS) , resource allocation
- 등재 SCOPUS
- 발행기관 IEEE Computer Society
- 발행년도 2016
- 총서유형 Journal
- URI http://www.dcollection.net/handler/ewha/000000139586
- ISBN 9781467399913
- 본문언어 영어
- Published As http://dx.doi.org/10.1109/ICUFN.2016.7537082
초록/요약
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.
more