Coalition based low-complexity algorithm for Nash bargaining solution
- 1 July 2016
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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.Keywords
This publication has 5 references indexed in Scilit:
- A game theoretical approach for QoS provisioning in heterogeneous networksICT Express, 2015
- A Distributed Algorithm for Wireless Resource Allocation Using Coalitions and the Nash Bargaining SolutionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Bargaining Strategies for Networked Multimedia Resource ManagementIEEE Transactions on Signal Processing, 2007
- Fair multiuser channel allocation for OFDMA networks using Nash bargaining solutions and coalitionsIEEE Transactions on Communications, 2005
- The Bargaining ProblemEconometrica, 1950