基于非合作竞价博弈的网络资源分配算法的应用研究  

Application Research of Network Resource Allocation Algorithm Based on Non-Cooperative Bidding Game

作　　者：陶军[1] 吴清亮[2] 吴强[1] 

机构地区：[1]东南大学教育部计算机网络和信息集成重点实验室,江苏南京210096 [2]东南大学计算机科学与工程系,江苏南京210096

出　　处：《电子学报》2006年第2期241-246,共6页Acta Electronica Sinica

基　　金：国家重点基础研究发展计划(973计划)基金(No.2003CB314801);国家自然科学基金(No.60573133);高等学校博士学科点专项基金(No.20040286001)

摘　　要：本文运用博弈理论对资源分配技术进行了深入研究,提出了能够反映供求关系的基于竞价的网络资源定价机制,并设计了端系统的效用函数,论证了资源分配博弈中N ash均衡点的存在性和唯一性以及N ash均衡解.基于所提资源分配博弈模型,设计了一种网络资源分配算法(RANG).仿真实验表明,RANG算法能够为端系统的资源数量提供参考,规范端系统竞价,从而使得整个资源的分配趋于合理.Game theory is applied to study the resource allocation technologies further in this paper. The mechanism of network resource pricing, which shows the relation of supply and demand, was presented based on bidding. Subsequently, we designed the utility function of end system and proved the existence and uniqueness of Nash Equilibrium in resource allocation game. At last, we present a network resource allocation algorithm （RANG） based on the resource allocation game model. The results of experiment and simulation show that RANG algorithm can provide references for the quantity of the resource that users demand and regularize the users ＇bids. Consequently, the allocation of the whole network resource tends to be more reasonable.

关 键 词：资源分配博弈 NASH均衡 竞价 效用 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]