Skip to main content

Dynamic Budget-Constrained Pricing in the Cloud

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9091))

Included in the following conference series:

Abstract

We introduce a new model of user-based dynamic pricing in which decisions occur in real time and are strongly influenced by the budget constraints of users. This model captures the fundamental operation of many electronic markets that are used for allocating resources. In particular, we focus on those used in data centers and cloud computing where pricing is often an internal mechanism used to efficiently allocate virtual machines. We study the allocative properties and dynamic stability of this pricing model under a standard framework of cloud computing systems which leads to highly degenerate systems of prices. We show that as the size of the system grows the user-based budget-constrained dynamic pricing mechanism converges to the standard Walrasian prices. However, for finite systems, the prices can be non-degenerate and the allocations unfair, with large groups of users receiving allocations significantly below their fair share. In addition, we show that improper choice of price update parameters can lead to significant instabilities in prices, which could be problematic in real cloud computing systems, by inducing system instabilities and allowing manipulations by users. We construct scaling rules for parameters that reduce these instabilities.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ananthanarayanan, G., Ghodsi, A., Shenker, S., Stoica, I.: Disk-locality in datacenter computing considered irrelevant. In: Proceedings of the 13th USENIX Workshop on Hot Topics in Operating Systems, pp. 1–5 (2011)

    Google Scholar 

  2. Bhattacharya, A.A., Culler, D., Friedman, E., Ghodsi, A., Shenker, S., Stoica, I.: Hierarchical scheduling for diverse datacenter workloads. In: Proceedings of ACM Symposium on Cloud Computing, SoCC 2013 (2013)

    Google Scholar 

  3. Chun, B., Culler, D., Roscoe, T., Bavier, A., Peterson, L., Wawrzoniak, M., Bowman, M.: Planetlab: an overlay testbed for broad-coverage services. ACM SIGCOMM Computer Communication Review 33(3), 3–12 (2003)

    Article  Google Scholar 

  4. Cole, R., Fleischer, L.: Fast-Converging tatonnement algorithms for one-time and ongoing market problems. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 315–324. ACM (2008)

    Google Scholar 

  5. Debreu, G., Scarf, H.: A limit theorem on the core of an economy. International Economic Review 4(3), 235–246 (1963)

    Article  MATH  Google Scholar 

  6. Friedman, E.J., Halpern, J.Y., Kash, I.: Efficiency and nash equilibria in a scrip system for P2P networks. In: Feigenbaum, J., Chuang, J., Pennock, D. (eds.) ACM Conference on Electronic Commerce (EC), pp. 140–149 (2006)

    Google Scholar 

  7. Ghodsi, A., Zaharia, M., Shenker, S., Stoica, I.: Choosy: max-min fair sharing for datacenter jobs with constraints. In: Proceedings of the 8th ACM European Conference on Computer Systems, pp. 365–378. ACM (2013)

    Google Scholar 

  8. Hahne, E.L., Gallager, R.G.: Round robin scheduling for fair flow control in data communication networks. NASA STI/Recon Tech. Rep. N 86, 30047 (1986)

    Google Scholar 

  9. Hindman, B., Konwinski, A., Zaharia, M., Ghodsi, A., Joseph, A.D., Katz, R.H., Shenker, S., Stoica, I.: Mesos: a platform for fine-grained resource sharing in the data center. In: Proceedings of NSDI (2011)

    Google Scholar 

  10. Il’in, A.M., Khasminskii, R.Z., Yin, G.: Singularly Perturbed Switching Diffusions: Rapid Switchings and Fast Diffusions. Journal of Optimization Theory and Applications 102(3), 555–591 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  11. Sweeney, J., Sweeney, R.J.: Monetary theory and the great Capitol Hill Baby Sitting Co-op crisis: comment. J. of Money, Credit and Banking 9(1), 86–89 (1977)

    Article  Google Scholar 

  12. Timberlake, R.H.: Private production of scrip-money in the isolated community. Journal of Money, Credit and Banking 19(4), 437–447 (1987)

    Article  Google Scholar 

  13. Uzawa, H.: Walras’ Tatonnement in the Theory of Exchange. The Review of Economic Studies 27(3), 182–194 (1960)

    Article  Google Scholar 

  14. Walras, L.: Elements of Pure Economics Or The Theory of Social Wealth (1954)

    Google Scholar 

  15. Yin, G., Zhang, Q.: Continuous-Time Markov Chains and Applications: A Two-Time-Scale Approach, vol. 37. Springer (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Miklós Z. Rácz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Friedman, E., Rácz, M.Z., Shenker, S. (2015). Dynamic Budget-Constrained Pricing in the Cloud. In: Barbosa, D., Milios, E. (eds) Advances in Artificial Intelligence. Canadian AI 2015. Lecture Notes in Computer Science(), vol 9091. Springer, Cham. https://doi.org/10.1007/978-3-319-18356-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18356-5_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18355-8

  • Online ISBN: 978-3-319-18356-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics