Optimal Dynamic Fees for Blockchain Resources
Davide Crapis, Ciamac C. Moallemi, Shouqiao Wang

TL;DR
This paper presents a comprehensive framework for designing optimal dynamic fee mechanisms for multiple blockchain resources, balancing demand responsiveness and robustness, with practical applications to Ethereum fee policies.
Contribution
It introduces a novel framework for multi-resource fee optimization, accounting for cross-effects and informing heuristic fee rule improvements.
Findings
Optimal policies effectively handle resource demand cross-effects.
Bundling resources with low demand cross-effects simplifies pricing.
Empirical analysis shows improved performance over existing fee mechanisms.
Abstract
We develop a general and practical framework to address the problem of the optimal design of dynamic fee mechanisms for multiple blockchain resources. Our framework allows to compute policies that optimally trade-off between adjusting resource prices to handle persistent demand shifts versus being robust to local noise in the observed block demand. In the general case with more than one resource, our optimal policies correctly handle cross-effects (complementarity and substitutability) in resource demands. We also show how these cross-effects can be used to inform resource design, i.e. combining resources into bundles that have low demand-side cross-effects can yield simpler and more efficient price-update rules. Our framework is also practical, we demonstrate how it can be used to refine or inform the design of heuristic fee update rules such as EIP-1559 or EIP-4844 with two case…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security · Auction Theory and Applications · Cloud Computing and Resource Management
