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

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Chitra, Tarun
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915211927093248
author Chitra, Tarun
author_facet Chitra, Tarun
contents 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 $Ω(\sqrt{T})$ regret. We then study competitive behavior between curators, demonstrating that adaptive supply mechanisms maximize revenue and welfare for both borrowers and lenders.
format Preprint
id arxiv_https___arxiv_org_abs_2503_18237
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A Curationary Tale: Logarithmic Regret in DeFi Lending via Dynamic Pricing
Chitra, Tarun
Computer Science and Game Theory
Risk Management
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 $Ω(\sqrt{T})$ regret. We then study competitive behavior between curators, demonstrating that adaptive supply mechanisms maximize revenue and welfare for both borrowers and lenders.
title A Curationary Tale: Logarithmic Regret in DeFi Lending via Dynamic Pricing
topic Computer Science and Game Theory
Risk Management
url https://arxiv.org/abs/2503.18237