Serial Monopoly on Blockchains with Quasi-patient Users
Paolo Penna, Manvir Schneider

TL;DR
This paper models blockchain transaction fee dynamics with quasi-patient users, bridging the gap between impatient and fully patient user models, and provides bounds on price fluctuations and transaction admission guarantees.
Contribution
It introduces a new model with quasi-patient users, analyzing how varying patience levels affect transaction fee dynamics and welfare in blockchain monopolistic pricing.
Findings
Price dynamics depend on user patience level $oldsymbol{\delta}$.
Bounds on price fluctuations are derived for different $oldsymbol{\delta}$ values.
The model reveals a transition phase with unexpected effects on prices and welfare.
Abstract
In the face of limited block size, miners (e.g., in Bitcoin) prioritize high-bid transactions, forming a large part of their revenue. If the block size were to expand significantly, meeting all transaction demand due to infrastructure or protocol improvements, bids could drop to zero or to a minimum fee, reducing mining incentives and potentially affecting security. To address this, Lavi et al. (2022) introduced a monopolistic pricing mechanism where miners only include transactions paying a minimum price, ensuring some revenue but resulting in an unbounded loss in welfare. Nisan (2023) expands this by modeling bidders as patient, who wait indefinitely long for lower prices, causing price fluctuations even with stable demand. In order to capture users' diminishing interest in having their transactions added to the ledger over time, we consider a more realistic setting with quasi-patient…
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 · Digital Platforms and Economics
