A cooperative game theoretic framework for resource allocation in OFDMA systems

We consider a downlink resource allocation problem in an orthogonal frequency division multiple access system. The resource allocation problem is modelled as a cooperative game where a fairness criterion is enforced in the bargaining outcome of the game. Given a minimum rate requirement for each user, Nash bargaining model ensures all users to attain their minimum rate requirements. If a set of maximum rate requirement is also provided, Raiffa-Kalai-Smorodinsky bargaining model regulates the bargaining outcome to consider both the minimum and maximum requirements of all users. The main interest of the cooperative game is to achieve a Pareto optimal outcome. In this paper, we proposed a reduced complexity algorithm to achieve transmission rates as close as possible to the Pareto optimal rates. Simulation results are shown to illustrate the achievable rates among all users for the outcome of the bargaining solutions.