Home > Research > Publications & Outputs > Game-Theoretic Analysis of an Exclusively Trans...

Electronic data

  • FINAL Article

    Accepted author manuscript, 1.62 MB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

View graph of relations

Game-Theoretic Analysis of an Exclusively Transaction-Fee Reward Blockchain System

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Game-Theoretic Analysis of an Exclusively Transaction-Fee Reward Blockchain System. / Kruminis, Edvinas; Navaie, Keivan.
In: IEEE Access, Vol. 10, 31.01.2022, p. 5002-5011.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Kruminis E, Navaie K. Game-Theoretic Analysis of an Exclusively Transaction-Fee Reward Blockchain System. IEEE Access. 2022 Jan 31;10:5002-5011. Epub 2022 Jan 6. doi: 10.1109/access.2022.3140921

Author

Bibtex

@article{8ed0c23e0e544fd1987e48e42bd2f1d9,
title = "Game-Theoretic Analysis of an Exclusively Transaction-Fee Reward Blockchain System",
abstract = "Miners in a blockchain system are typically rewarded in two ways - through a fixed block reward, and by the transaction fees that are voluntarily offered by its users. As the available space inside a block is limited, users must compete against each other by submitting higher fees to obtain this limited resource. In this paper, we model blockchain transaction inclusion as a time-sensitive dynamic game, where users base their fees depending on both what their competitors in the network are offering, and by their own urgency of having their transactions approved. We then investigate the effect that mempool congestion (the aggregate size of transactions waiting to be confirmed) and different block sizes have on the fees users would be willing to pay. Our analysis concludes that miners have no rational reason to artificially limit the block size, which is in direct contrast with previous research findings. Instead, we find that increasing the block size in relation to a growing mempool both lowers the individual fees that users have to pay, and increases the total in fees collected, which raises not only the utility of the miners, but also of the regular users of the blockchain system.",
author = "Edvinas Kruminis and Keivan Navaie",
year = "2022",
month = jan,
day = "31",
doi = "10.1109/access.2022.3140921",
language = "English",
volume = "10",
pages = "5002--5011",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

RIS

TY - JOUR

T1 - Game-Theoretic Analysis of an Exclusively Transaction-Fee Reward Blockchain System

AU - Kruminis, Edvinas

AU - Navaie, Keivan

PY - 2022/1/31

Y1 - 2022/1/31

N2 - Miners in a blockchain system are typically rewarded in two ways - through a fixed block reward, and by the transaction fees that are voluntarily offered by its users. As the available space inside a block is limited, users must compete against each other by submitting higher fees to obtain this limited resource. In this paper, we model blockchain transaction inclusion as a time-sensitive dynamic game, where users base their fees depending on both what their competitors in the network are offering, and by their own urgency of having their transactions approved. We then investigate the effect that mempool congestion (the aggregate size of transactions waiting to be confirmed) and different block sizes have on the fees users would be willing to pay. Our analysis concludes that miners have no rational reason to artificially limit the block size, which is in direct contrast with previous research findings. Instead, we find that increasing the block size in relation to a growing mempool both lowers the individual fees that users have to pay, and increases the total in fees collected, which raises not only the utility of the miners, but also of the regular users of the blockchain system.

AB - Miners in a blockchain system are typically rewarded in two ways - through a fixed block reward, and by the transaction fees that are voluntarily offered by its users. As the available space inside a block is limited, users must compete against each other by submitting higher fees to obtain this limited resource. In this paper, we model blockchain transaction inclusion as a time-sensitive dynamic game, where users base their fees depending on both what their competitors in the network are offering, and by their own urgency of having their transactions approved. We then investigate the effect that mempool congestion (the aggregate size of transactions waiting to be confirmed) and different block sizes have on the fees users would be willing to pay. Our analysis concludes that miners have no rational reason to artificially limit the block size, which is in direct contrast with previous research findings. Instead, we find that increasing the block size in relation to a growing mempool both lowers the individual fees that users have to pay, and increases the total in fees collected, which raises not only the utility of the miners, but also of the regular users of the blockchain system.

U2 - 10.1109/access.2022.3140921

DO - 10.1109/access.2022.3140921

M3 - Journal article

VL - 10

SP - 5002

EP - 5011

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

ER -