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.