CAJ | 학술논문

针对带有一对属性值（ai ，bi ）的n个agent分配m个资源问题，构建了该问题的博弈模型，给出了判断Nash均衡是否存在的充要条件，利用充要条件对Nash均衡的存在性进行分析和讨论，并且分析了Nash均衡与最优分配的关系。设计了求解最优分配的算法，并证明了算法是收敛的，证明过程显示该算法的收敛性与初始分配无关。
침대대유일대속성치（ai ，bi ）적n개agent분배m개자원문제，구건료해문제적박혁모형，급출료판단Nash균형시부존재적충요조건，이용충요조건대Nash균형적존재성진행분석화토론，병차분석료Nash균형여최우분배적관계。설계료구해최우분배적산법，병증명료산법시수렴적，증명과정현시해산법적수렴성여초시분배무관。
Aiming at a pair of attribute values in n agent allocation of m resources ,a game model of this problem is con‐stracted and the necessary and sufficient condition to decide w hether the existence of Nash equilibrium is given .By using the necessary and sufficient conditions the existence of Nash equilibrium points are analyzed and discussed ,and the relationship between the Nash equilibrium and the optimal allocation is analyzed .To solve optimal allocation algorithm design ,it is proved that the algorithm is convergent .The proving process shows the convergence and the algorithm is independent of the initial distribution .