非合作寡头博弈与干扰信道资源分配

Non-Cooperative Stackelberg Game and Resource Allocation in Interference Channels

  • 摘要: 将多用户干扰信道频率和功率资源分配问题用寡头博弈模型进行分析. 寡头博弈中有一个超级用户,它知道其它用户的所有信道信息,并且知道它们所采取的策略,那么这个超级用户将可以计算出对自己更有利的资源分配方案,获取比纳什模型更高的速率. 通常在非合作分布式系统中,获取其它用户信息是非常困难的,本文提出的算法可以让用户从干扰强度的变化中学习得到有用信息,从而设计出基于寡头博弈模型的分布式算法.

     

    Abstract: The power and subcarrier resource allocation problem in interference channels using stackelberg game was studied. Stackelberg games with a leader who knows the complete channel state information (CSI) and the strategies of all other users can find better strategies than Nash games, but it is hard to get the useful information in a non-cooperative network. This question can be answered and a distributed stackelberg equilibrium (SE) algorithm was proposed that SE can be achieved with the aid of only users' local CSI.

     

/

返回文章
返回
Baidu
map