首页> 外国专利> METHOD AND SYSTEM FOR ALLOCATING RESOURCES USING TRANSFORMATION-BASED LOW COMPLEXITY ALGORITHM FOR NASH BARGAINING SOLUTIONS IN DYNAMIC NETWORKS

METHOD AND SYSTEM FOR ALLOCATING RESOURCES USING TRANSFORMATION-BASED LOW COMPLEXITY ALGORITHM FOR NASH BARGAINING SOLUTIONS IN DYNAMIC NETWORKS

机译:基于变换的低复杂度算法动态网络中NASH讨价还价的资源分配方法和系统

摘要

According to embodiments of the present invention, a method for allocating resources of a dynamic network using a Nash bargaining solution comprises the steps of obtaining a linear transformation matrix which can map an effective utility set of a current time slot to the effective utility set of a next time slot; determining a transformation coordinate which is obtained by converting Nash bargaining solution of the current time slot by the linear transformation matrix; determining the effectiveness of the transformation coordinate with respect to the effective utility set of the next time slot; calculating the Nash bargaining solution of the next time slot based on a sub-feasible utility set of the effective utility set which regards a valid transformation coordinate as a concurrence failure point; and calculating the Nash bargaining solution of the next time slot based on a navigation area consisting of Pareto optimal points relative to a non-effective transformation coordinate.
机译:根据本发明的实施例,一种用于使用纳什议价解决方案分配动态网络的资源的方法,包括以下步骤:获得线性变换矩阵,该矩阵可以将当前时隙的有效效用集映射到网络的有效效用集。下一个时隙;确定通过线性变换矩阵转换当前时隙的纳什议价解得到的变换坐标;确定变换坐标相对于下一个时隙的有效效用集的有效性;基于有效效用集的子可行效用集计算下一时隙的纳什讨价还价解,该效用集以有效的变换坐标为并发失败点;并基于由相对于无效变换坐标的帕累托最优点组成的导航区域,计算下一时隙的纳什议价解。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号