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.
| Original language | English |
|---|---|
| Title of host publication | ICUFN 2016 - 8th International Conference on Ubiquitous and Future Networks |
| Publisher | IEEE Computer Society |
| Pages | 498-500 |
| Number of pages | 3 |
| ISBN (Electronic) | 9781467399913 |
| DOIs | |
| State | Published - 9 Aug 2016 |
| Event | 8th International Conference on Ubiquitous and Future Networks, ICUFN 2016 - Vienna, Austria Duration: 5 Jul 2016 → 8 Jul 2016 |
Publication series
| Name | International Conference on Ubiquitous and Future Networks, ICUFN |
|---|---|
| Volume | 2016-August |
| ISSN (Print) | 2165-8528 |
| ISSN (Electronic) | 2165-8536 |
Conference
| Conference | 8th International Conference on Ubiquitous and Future Networks, ICUFN 2016 |
|---|---|
| Country/Territory | Austria |
| City | Vienna |
| Period | 5/07/16 → 8/07/16 |
Bibliographical note
Publisher Copyright:© 2016 IEEE.
Keywords
- coalition formation
- cooperative games
- Nash bargaining solution (NBS)
- resource allocation