Non-symmetric Nash bargaining solution for resource allocation in wireless networks and connection to interference calculus

Proportional fair resource allocation can be interpreted as a symmetric Nash bargaining game associated with a framework of axioms. However, the assumption of symmetry is not always appropriate, especially for users with different service and priority classes. Also, the axiom "scale transformation covariance" is quite restrictive in a wireless context. In this paper we take a different approach. We investigate different degrees of cooperation based on individual user requirements. A new axiomatic framework is proposed, which leads to the asymmetric weighted Nash bargaining solution. This strategy corresponds to the known concept of weighted proportional fairness. Different aspects of this problem are discussed and connections with a recently proposed interference calculus are derived.