IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2502.08022.html
   My bibliography  Save this paper

Optimal Pricing of Cloud Services: Committed Spend under Demand Uncertainty

Author

Listed:
  • Dirk Bergemann
  • Michael C. Wang

Abstract

We consider a seller who offers services to a buyer with multi-unit demand. Prior to the realization of demand, the buyer receives a noisy signal of their future demand, and the seller can design contracts based on the reported value of this signal. Thus, the buyer can contract with the service provider for an unknown level of future consumption, such as in the market for cloud computing resources or software services. We characterize the optimal dynamic contract, extending the classic sequential screening framework to a nonlinear and multi-unit setting. The optimal mechanism gives discounts to buyers who report higher signals, but in exchange they must provide larger fixed payments. We then describe how the optimal mechanism can be implemented by two common forms of contracts observed in practice, the two-part tariff and the committed spend contract. Finally, we use extensions of our base model to shed light on policy-focused questions, such as analyzing how the optimal contract changes when the buyer faces commitment costs, or when there are liquid spot markets.

Suggested Citation

  • Dirk Bergemann & Michael C. Wang, 2025. "Optimal Pricing of Cloud Services: Committed Spend under Demand Uncertainty," Papers 2502.08022, arXiv.org.
  • Handle: RePEc:arx:papers:2502.08022
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2502.08022
    File Function: Latest version
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Susan Athey & Ilya Segal, 2013. "An Efficient Dynamic Mechanism," Econometrica, Econometric Society, vol. 81(6), pages 2463-2485, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hitoshi Matsushima & Shunya Noda, 2020. "Mechanism Design with Blockchain Enforcement," DSSR Discussion Papers 111, Graduate School of Economics and Management, Tohoku University.
    2. Cheng Wang, 1995. "Dynamic Insurance with Private Information and Balanced Budgets," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 62(4), pages 577-595.
    3. , H. & ,, 2016. "Approximate efficiency in repeated games with side-payments and correlated signals," Theoretical Economics, Econometric Society, vol. 11(1), January.
    4. Julio B. Clempner, 2023. "A Dynamic Mechanism Design for Controllable and Ergodic Markov Games," Computational Economics, Springer;Society for Computational Economics, vol. 61(3), pages 1151-1171, March.
    5. Francis Bloch & David Cantala, 2013. "Markovian assignment rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(1), pages 1-25, January.
    6. Golosov, Mikhail & Skreta, Vasiliki & Tsyvinski, Aleh & Wilson, Andrea, 2014. "Dynamic strategic information transmission," Journal of Economic Theory, Elsevier, vol. 151(C), pages 304-341.
    7. Daley, Brendan & Schwarz, Michael & Sonin, Konstantin, 2012. "Efficient investment in a dynamic auction environment," Games and Economic Behavior, Elsevier, vol. 75(1), pages 104-119.
    8. Francis Bloch & Simona Fabrizi & Steffen Lippert, 2015. "Learning and collusion in new markets with uncertain entry costs," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 58(2), pages 273-303, February.
    9. Said, Maher, 2012. "Auctions with dynamic populations: Efficiency and revenue maximization," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2419-2438.
    10. Dirk Bergemann & Juuso Välimäki, 2006. "Efficient Dynamic Auctions," Levine's Bibliography 321307000000000580, UCLA Department of Economics.
    11. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    12. Babaioff, Moshe & Blumrosen, Liad & Roth, Aaron, 2015. "Auctions with online supply," Games and Economic Behavior, Elsevier, vol. 90(C), pages 227-246.
    13. Mark Braverman & Sylvain Chassang, 2020. "Data-Driven Incentive Alignment in Capitation Schemes," Working Papers 2020-60, Princeton University. Economics Department..
    14. Matsushima, Hitoshi & Noda, Shunya, 2023. "Mechanism design with general ex-ante investments," Journal of Mathematical Economics, Elsevier, vol. 106(C).
    15. Krähmer, Daniel & Strausz, Roland, 2010. "Optimal Procurement Contracts with Pre–Project Planning," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 303, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
    16. Stéphane Auray & Thomas Mariotti & Fabien Moizeau, 2011. "Dynamic regulation of quality," RAND Journal of Economics, RAND Corporation, vol. 42(2), pages 246-265, June.
    17. Morimitsu Kurino, 2014. "House Allocation with Overlapping Generations," American Economic Journal: Microeconomics, American Economic Association, vol. 6(1), pages 258-289, February.
    18. Samuel Antill & Darrell Duffie, 2021. "Augmenting Markets with Mechanisms [Optimal Execution of Portfolio Transactions]," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 88(4), pages 1665-1719.
    19. Su, Alice Peng-Ju, 2017. "Information revelation in the Property Right Theory of the firms," International Journal of Industrial Organization, Elsevier, vol. 52(C), pages 133-164.
    20. Juntao Chen & Quanyan Zhu & Tamer Başar, 2021. "Dynamic Contract Design for Systemic Cyber Risk Management of Interdependent Enterprise Networks," Dynamic Games and Applications, Springer, vol. 11(2), pages 294-325, June.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2502.08022. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.