{"title":"An index policy for dynamic pricing in cloud computing under price commitments","authors":"V. Borkar, K. Ravikumar, Krishnakant V. Saboo","doi":"10.4064/AM2313-6-2017","DOIUrl":null,"url":null,"abstract":"A dynamic pricing based resource allocation problem for cloud computing is cast as a Markov decision process with average reward and hard per time combinatorial constraints. Following Whittle, its relaxation as a constrained average reward Markov decision process is analyzed and its Whittle indexability is established. An iterative scheme to compute the Whittle indices is also proposed.","PeriodicalId":52313,"journal":{"name":"Applicationes Mathematicae","volume":"4 1","pages":"215-245"},"PeriodicalIF":0.0000,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicationes Mathematicae","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4064/AM2313-6-2017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 20
Abstract
A dynamic pricing based resource allocation problem for cloud computing is cast as a Markov decision process with average reward and hard per time combinatorial constraints. Following Whittle, its relaxation as a constrained average reward Markov decision process is analyzed and its Whittle indexability is established. An iterative scheme to compute the Whittle indices is also proposed.