On Cooperative Radio Resource Allocation techniques based on Game Theory

Abstract: Modern wireless communication systems are operating over multiple frequency selective channels, in which users can change their transmission or reception parameters to communicate efficiently by avoiding interference from other users. In the last several years major research efforts were concentrated on finding cooperative strategies for allocating radio resources efficiently under system constraints.
While the single-carrier problems are commonly easily to address, the multi-carrier problems are more complex and have major role in the evolution of future wireless systems based on Orthogonal Frequency Division Multi Access (OFDMA).
In the talk we address the multi-carrier allocation problem. We will outline several cooperative approaches (solutions) for sharing K frequency bins between N users. The following solutions will be introduced: Stable Matching solution, Nash Bargaining Solution (NBS), and Raiffa’s Discrete Bargaining Solution. We will show that all these solutions can be written as a solution to a weighted max-min problem, where at most N-1 frequency bins have to be shared by more more than one user, and some of these solutions can be obtained by a distributed protocols. This introduces a new way of solving distributed stochastic optimization by using the properties of the communication channel.