Pareto-optimal solutions of Nash bargaining resource allocation games with spectral mask and total power constraints

The problem of resource allocation among multiple users with total power and spectral mask constraints is studied based on cooperative game-theoretic approach. The problem is non-convex, and finding the optimal solution requires joint power and bandwidth allocation that renders high-complexity algorithms. Therefore, we first categorize the systems to bandwidth-dominant and power-dominant according to their bottleneck resources. Then, different manners of cooperation are adopted for each type of systems, and a two-user algorithm is developed for each case. Such categorization guarantees that the solution obtained in each case is Pareto-optimal, while the complexity is significantly reduced.