首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Strategy Configurations of Multiple Users Competition for Cloud Service Reservation
【24h】

Strategy Configurations of Multiple Users Competition for Cloud Service Reservation

机译:云服务预订的多用户竞争策略配置

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we focus on strategy configurations of multiple users to make cloud service reservation. We consider the problem from a game theoretic perspective and formulate it into a non-cooperative game among the multiple cloud users, in which each user is informed with incomplete information of other users. For each user, we design a utility function which combines the net profit with time efficiency and try to maximize its value. We solve the problem by employing variational inequality (VI) theory and prove that there exists a Nash equilibrium solution set for the formulated game. Then, we propose an iterative proximal algorithm (IPA), which is designed to compute a Nash equilibrium solution. The convergence of the IPA algorithm is also analyzed and we find that it converges to a Nash equilibrium if several conditions are satisfied. Finally, we conduct some numerical calculations to verify our theoretical analysis. The experimental results show that our proposed IPA algorithm converges to a stable state very quickly and improves the utilities of all users to certain extent by configuring a proper request strategy.
机译:在本文中,我们专注于多个用户的策略配置以进行云服务预订。我们从博弈论的角度考虑问题,并将其表述为多个云用​​户之间的非合作游戏,其中每个用户都被告知其他用户的不完整信息。我们为每个用户设计了一个实用功能,该功能将净利润与时间效率相结合,并力图使其价值最大化。我们通过运用变分不等式(VI)理论解决了这一问题,并证明存在针对公式博弈的Nash均衡解集。然后,我们提出了一种迭代近端算法(IPA),该算法旨在计算Nash平衡解。还分析了IPA算法的收敛性,发现如果满足多个条件,则收敛到Nash平衡。最后,我们进行一些数值计算以验证我们的理论分析。实验结果表明,我们提出的IPA算法可以快速收敛到稳定状态,并通过配置适当的请求策略在一定程度上提高了所有用户的效用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号