合作博弈框架的资源分配  

A Resource Allocation Algorithm Based on Cooperative Game Theoretic Framework

作　　者：惠毅[1] 周志杰[1] 张文强[1] 黄炳刚[1] 赵陆文[1] 

机构地区：[1]解放军理工大学通信工程学院,江苏南京210007

出　　处：《应用科学学报》2008年第5期489-494,共6页Journal of Applied Sciences

摘　　要：提出一种多用户MIMO OFDM系统中的基于合作博弈框架的自适应资源分配算法,该算法在纳什讨价还价解(NBS)和Raiffa-Kalai-Smorodinsky讨价还价解(RBS)的Pareto最优解的基础上分配资源,使用户的速率能够最接近于Pareto最优解.仿真结果表明,该算法的性能明显优于固定分配方案,只是略逊于Max Rate方案,但是其公平性明显优于Max Rate方案和固定分配方案.A adaptive resource allocation algorithm of multiuser MIMO OFDM systems based on cooperative game theoretic framework is proposed and simulated. The algorithm allocates resources based on the Pareto solutions of Nash Bargaining Solution and Raiffa-Kalai-Smorodinsky Bargaining Solution, make the rate of users close to the Pareto solution. Simulation results show that the performance of the proposed algorithm is obviously better than the fixed allocation algorithm, and close to the max rate scheme. But the impartiality of the proposed algorithm is the best.

关 键 词：合作博弈框架 纳什讨价还价解 Raiffa-Kalai-Smorodinsky讨价还价解 

分 类 号：TN913[电子电信—通信与信息系统]