Strategic Users in a Priority Queue with Bulk Service on Blockchains
For blockchain researchers and network designers, this provides a theoretical framework to understand transaction fee dynamics, though the results are incremental extensions of existing queueing theory.
This paper models blockchain transaction fees as a priority queue game using an M/G^K/1 model, deriving semi-closed form expressions for steady-state quantities and extending the relationship between user delay costs and fees to general block generation times. Applied to Bitcoin, Dogecoin, and Litecoin, it reveals similarities in normalized cost structures.
This paper analyzes transaction fees on blockchains by considering that they form a priority queue and users play a queueing game. Using an M/G^K/1 priority queue model, we provide new insights into the dynamics governing transaction fees and their impact on user behavior. We derive semi-closed form expressions for steady-state quantities and extend the relationship between user delay costs and transaction fees to general block generation times. We apply the model to the Bitcoin network and simulate user responses under various scenarios. Cross-chain analysis across Bitcoin, Dogecoin, and Litecoin reveals similarities in normalized cost structures.