Stability of service under time-of-use pricing

作者: Shuchi Chawla , Nikhil R. Devanur , Alexander E. Holroyd , Anna R. Karlin , James B. Martin

DOI: 10.1145/3055399.3055455

关键词: Cloud computingQueueing theoryComputer scienceStochastic modellingService (economics)Matching (statistics)Bernoulli trialSupply and demandResource (project management)Mathematical optimization

摘要: We consider time-of-use pricing as a technique for matching supply and demand of temporal resources with the goal maximizing social welfare. Relevant examples include energy, computing on cloud platform, charging stations electric vehicles, among many others. A client/job in this setting has window time during which he needs service, particular value obtaining it. assume stochastic model demand, where each job materializes some probability via an independent Bernoulli trial. Given per-time-unit resources, any realized will first try to get served by cheapest available resource its and, failing that, find service at next resource, so on. Thus, natural fluctuations have potential lead cascading overload events. Our main result shows that prices optimally handle expected works well: high probability, when actual is instantiated, system stable jobs very close optimal offline algorithm.

参考文章(19)
Yossi Azar, Ety Khaitsin, Prompt mechanism for ad placement over time algorithmic game theory. pp. 19- 30 ,(2011) , 10.1007/978-3-642-24829-0_4
Richard Cole, Shahar Dobzinski, Lisa Fleischer, Prompt Mechanisms for Online Auctions algorithmic game theory. pp. 170- 181 ,(2008) , 10.1007/978-3-540-79309-0_16
Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Cliff Stein, Online stochastic packing applied to display ad allocation european symposium on algorithms. pp. 182- 194 ,(2010) , 10.1007/978-3-642-15775-2_16
Nikhil R. Devanur, Shipra Agrawal, Fast algorithms for online stochastic convex programming symposium on discrete algorithms. pp. 1405- 1424 ,(2015) , 10.5555/2722129.2722222
Ran Canetti, Sandy Irani, Bounding the Power of Preemption in Randomized Scheduling SIAM Journal on Computing. ,vol. 27, pp. 993- 1015 ,(1998) , 10.1137/S0097539795283292
Ron Lavi, Noam Nisan, Online ascending auctions for gradually expiring items Journal of Economic Theory. ,vol. 156, pp. 45- 76 ,(2015) , 10.1016/J.JET.2014.07.010
Gagan Goel, Aranyak Mehta, Online budgeted matching in random input models with applications to Adwords symposium on discrete algorithms. pp. 982- 991 ,(2008)
Shlomo Halfin, Ward Whitt, Heavy-Traffic Limits for Queues with Many Exponential Servers Operations Research. ,vol. 29, pp. 567- 588 ,(1981) , 10.1287/OPRE.29.3.567
Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, Christopher A. Wilkens, Near optimal online algorithms and fast approximation algorithms for resource allocation problems electronic commerce. pp. 29- 38 ,(2011) , 10.1145/1993574.1993581
Thomas Kesselheim, Andreas Tönnis, Klaus Radke, Berthold Vöcking, Primal beats dual on online packing LPs in the random-order model symposium on the theory of computing. ,vol. 47, pp. 303- 312 ,(2014) , 10.1145/2591796.2591810