首页> 外文会议>IIAI International Congress on Advanced Applied Informatics >A Dynamic Programming Method for a Reverse Auction Model in Service Choice Markets
【24h】

A Dynamic Programming Method for a Reverse Auction Model in Service Choice Markets

机译:服务选择市场中逆向拍卖模型的动态规划方法

获取原文

摘要

In recent years, there are many service providers on cloud environment. We consider a service choice market, which service providers offer a price and quality of service, users choose a combination of services based on these offers. Since this market is asymmetry information setting, appropriate pricing gives no opportunity loss to service providers. To solve this issue, a VCG based reverse auction model for the service choice market is considered. For this model, a dynamic programming method is proposed to solve. However, this work has a computational complexity issue. Therefore we propose a new dynamic programming method, which is faster than previous work.
机译:近年来,云环境上有许多服务提供商。我们考虑一个服务选择市场,由服务提供商提供价格和服务质量,用户根据这些服务选择服务组合。由于该市场是不对称的信息设置,因此适当的定价不会给服务提供商带来任何机会损失。为了解决这个问题,考虑了针对服务选择市场的基于VCG的反向拍卖模型。针对该模型,提出了一种动态规划方法来求解。但是,这项工作存在计算复杂性的问题。因此,我们提出了一种新的动态编程方法,该方法比以前的工作要快。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号