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

A Curationary Tale: Logarithmic Regret in DeFi Lending via Dynamic Pricing

Author

Listed:
  • Tarun Chitra

Abstract

Lending within decentralized finance (DeFi) has facilitated over \$100 billion of loans since 2020. A long-standing inefficiency in DeFi lending protocols such as Aave is the use of static pricing mechanisms for loans. These mechanisms have been shown to maximize neither welfare nor revenue for participants in DeFi lending protocols. Recently, adaptive supply models pioneered by Morpho and Euler have become a popular means of dynamic pricing for loans. This pricing is facilitated by agents known as curators, who bid to match supply and demand. We construct and analyze an online learning model for static and dynamic pricing models within DeFi lending. We show that when loans are small and have a short duration relative to an observation time $T$, adaptive supply models achieve $O(\log T)$ regret, while static models cannot achieve better than $\Omega(\sqrt{T})$ regret. We then study competitive behavior between curators, demonstrating that adaptive supply mechanisms maximize revenue and welfare for both borrowers and lenders.

Suggested Citation

  • Tarun Chitra, 2025. "A Curationary Tale: Logarithmic Regret in DeFi Lending via Dynamic Pricing," Papers 2503.18237, arXiv.org.
    • Handle: RePEc:arx:papers:2503.18237
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Nicholas C. Petruzzi & Maqbool Dada, 1999. "Pricing and the Newsvendor Problem: A Review with Extensions," Operations Research, INFORMS, vol. 47(2), pages 183-194, April.
    2. Omar Besbes & Yonatan Gur & Assaf Zeevi, 2015. "Non-Stationary Stochastic Optimization," Operations Research, INFORMS, vol. 63(5), pages 1227-1244, October.
    3. Foster, Dean P. & Vohra, Rakesh V., 1997. "Calibrated Learning and Correlated Equilibrium," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 40-55, October.
    4. Guillermo Gallego & Garrett van Ryzin, 1994. "Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons," Management Science, INFORMS, vol. 40(8), pages 999-1020, August.
    5. Foster, Dean P. & Vohra, Rakesh, 1999. "Regret in the On-Line Decision Problem," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 7-35, October.
    6. Saengchote, Kanis, 2023. "Decentralized lending and its users: Insights from compound," Journal of International Financial Markets, Institutions and Money, Elsevier, vol. 87(C).
    7. Omar Besbes & Assaf Zeevi, 2009. "Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms," Operations Research, INFORMS, vol. 57(6), pages 1407-1420, December.
    8. Qin, Yan & Wang, Ruoxuan & Vakharia, Asoo J. & Chen, Yuwen & Seref, Michelle M.H., 2011. "The newsvendor problem: Review and directions for future research," European Journal of Operational Research, Elsevier, vol. 213(2), pages 361-374, September.
    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. Mitra, Subrata, 2018. "Newsvendor problem with clearance pricing," European Journal of Operational Research, Elsevier, vol. 268(1), pages 193-202.
    2. Yang, Xiangyu & Zhang, Jianghua & Hu, Jian-Qiang & Hu, Jiaqiao, 2024. "Nonparametric multi-product dynamic pricing with demand learning via simultaneous price perturbation," European Journal of Operational Research, Elsevier, vol. 319(1), pages 191-205.
    3. Hu, Chaoming & Wan, Zhao Man & Zhu, Saihua & Wan, Zhong, 2022. "An integrated stochastic model and algorithm for constrained multi-item newsvendor problems by two-stage decision-making approach," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 193(C), pages 280-300.
    4. Christopher S. Tang & Onesun Steve Yoo & Dongyuan Zhan, 2023. "When should grocery stores adopt time‐based pricing? Impact of competition and negative congestion externality," Production and Operations Management, Production and Operations Management Society, vol. 32(9), pages 2805-2824, September.
    5. Fudenberg, Drew & Levine, David K., 1999. "Conditional Universal Consistency," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 104-130, October.
    6. Jianyu Xu & Yining Wang & Xi Chen & Yu-Xiang Wang, 2025. "Dynamic Pricing with Adversarially-Censored Demands," Papers 2502.06168, arXiv.org.
    7. Schulte, Benedikt & Sachs, Anna-Lena, 2020. "The price-setting newsvendor with Poisson demand," European Journal of Operational Research, Elsevier, vol. 283(1), pages 125-137.
    8. Serrano, Breno & Minner, Stefan & Schiffer, Maximilian & Vidal, Thibaut, 2024. "Bilevel optimization for feature selection in the data-driven newsvendor problem," European Journal of Operational Research, Elsevier, vol. 315(2), pages 703-714.
    9. Yiwei Chen & Vivek F. Farias, 2013. "Simple Policies for Dynamic Pricing with Imperfect Forecasts," Operations Research, INFORMS, vol. 61(3), pages 612-624, June.
    10. Xiao, Baichun & Yang, Wei, 2021. "A Bayesian learning model for estimating unknown demand parameter in revenue management," European Journal of Operational Research, Elsevier, vol. 293(1), pages 248-262.
    11. Ehud Lehrer & Eilon Solan, 2007. "Learning to play partially-specified equilibrium," Levine's Working Paper Archive 122247000000001436, David K. Levine.
    12. Josef Broder & Paat Rusmevichientong, 2012. "Dynamic Pricing Under a General Parametric Choice Model," Operations Research, INFORMS, vol. 60(4), pages 965-980, August.
    13. Mehran Ullah & Irfanullah Khan & Biswajit Sarkar, 2019. "Dynamic Pricing in a Multi-Period Newsvendor Under Stochastic Price-Dependent Demand," Mathematics, MDPI, vol. 7(6), pages 1-15, June.
    14. Karl Schlag & Andriy Zapechelnyuk, 2009. "Decision Making in Uncertain and Changing Environments," Discussion Papers 19, Kyiv School of Economics.
    15. Lingxiu Dong & Panos Kouvelis & Zhongjun Tian, 2009. "Dynamic Pricing and Inventory Control of Substitute Products," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 317-339, December.
    16. Boxiao Chen & Xiuli Chao & Cong Shi, 2021. "Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 726-756, May.
    17. Emerson Melo, 2021. "Learning in Random Utility Models Via Online Decision Problems," Papers 2112.10993, arXiv.org, revised Aug 2022.
    18. P-S You, 2003. "Dynamic pricing of inventory with cancellation demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1093-1101, October.
    19. Athanassios N. Avramidis & Arnoud V. Boer, 2021. "Dynamic pricing with finite price sets: a non-parametric approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(1), pages 1-34, August.
    20. Youkyung Won, 2016. "Dominance Relationship Among the Retailer’s Strategies Under the Semi-Stackelberg Newsvendor Situation with Quantity Discounts," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(02), pages 1-20, April.

    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:2503.18237. 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.